Generating facets for the cut polytope of a graph by triangular elimination

Mathematical Programming

Volumn 112, Issue 2, 2008, Pages 303-325

  Avis, David ^a   Imai, Hiroshi ^b,c   Ito, Tsuyoshi ^b  

^a MCGILL UNIVERSITY   (Canada)

^b UNIVERSITY OF TOKYO   (Japan)

^c JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

Cut polytope; Facet; Fourier Motzkin elimination; Graph; Lifting

Indexed keywords

COMPUTATIONAL GEOMETRY; INFORMATION SCIENCE;

CUT POLYTOPE; FOURIER-MOTZKIN ELIMINATION; QUANTUM INFORMATION SCIENCE; TRIANGULAR ELIMINATION;

GRAPH THEORY;

EID: 36749031261     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0018-z     Document Type: Article

References (31)

1. 1 embeddability, complexity and multicommodity flows. Networks 21(6): 595-617
2. Avis, D., Imai, H., Ito, T.: On the relationship between convex bodies related to correlation experiments with dichotomic observables. arXiv:quant-ph/0605148 (2006) (Submitted)
3. Avis D., Imai H., Ito T., Sasaki Y. Two-party Bell inequalities derived from combinatorics via triangular elimination. J. Phys. A. Math. General 38(50), 10971-10987, arXiv:quant-ph/0505060 (2005)
4. Barahona F., Grötschel M., Mahjoub A.R. (1985) Facets of the bipartite subgraph polytope. Math. Oper. Res. 10(2): 340-358
5. Barahona F., Mahjoub A.R. (1986) On the cut polytope. Math. Program. 36(2): 157-173
6. Bell J.S. (1964) On the Einstein Podolsky Rosen paradox. Physics 1(3): 195-200
7. Boole G. (1854) An Investigation of the Laws of Thought, on Which Are Founded the Mathematical Theories of Logic and Probabilities. Dover Publications, New York
8. Cleve, R., Høyer, P., Toner, B., Watrous, J.: Consequences and limits of nonlocal strategies. In: Proceedings of 19th IEEE Annual Conference on Computational Complexity (CCC'04), pp. 236-249, arXiv:quant-ph/0404076 (2004)
9. Collins, D., Gisin, N.: A relevant two qubit Bell inequality inequivalent to the CHSH inequality. J. Phys. A Math. General 37(5), 1775-1787, arXiv:quant-ph/0306129 (2004)
10. Deza M. (1973) Matrices des formes quadratiques non négatives pour des arguments binaires. C. R. Acad. Sci. Paris 277A(18): 873-875
11. Deza M., Laurent M. (1992) Facets for the cut cone I. math. Program. 56(2): 121-160
12. Deza M., Laurent M. (1992) Facets for the cut cone II: Clique-web inequalities. Math. Program. 56(2): 161-188
13. Deza M., Laurent M. (1994) Applications of cut polyhedra I. J. Comput. Appl. Math. 55(2): 191-216
14. Deza M., Laurent M. (1994) Applications of cut polyhedra II. J. Comput. Appl. Math. 55(2): 217-247
15. Deza M.M., Laurent M. (1997) Geometry of Cuts and Metrics. Algorithms and Combinatorics, vol. 15. Springer, Berlin Heidelberg New York
16. Froissart M. (1981) Constructive generalization of Bell's inequalities. Nuovo Cimento Soc Ital 64B(2): 241-251
17. n for n = 7 are known. Eur. J. Combin. 11(2): 115-117
18. Hammer P.L. (1965) Some network flow problems solved with pseudo-Boolean programming. Oper. Res. 13(3): 388-399
19. Krüger, O., Werner, R.F.: Some open problems in quantum information theory. arXiv:quant-ph/0504166. See also http://www.imaph.tu-bs.de/qi/problems/ problems.html, (2005)
20. McRae W.B., Davidson E.R. (1972) Linear inequalities for density matrices II. J. Math. Phys. 13(10): 1527-1538
21. Nemhauser G.L., Wolsey L.A. (1988) Integer and Combinatorial Optimization Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York
22. Peres, A.: All the Bell inequalities. Found. Phys. 29(4), 589-614, arXiv:quant-ph/9807017 (1999)
23. Pitowsky I. (1986) The range of quantum probability. J. Math. Phys. 27(6): 1556-1565
24. Pitowsky I.(1989) Quantum Probability - Quantum Logic. Lecture Notes in Physics, vol. 321. Springer, Berlin Heidelberg New York
25. Pitowsky I. (1991) Correlation polytopes: Their geometry and complexity. Math. Program. 50(3): 395-414
26. Pitowsky, I., Svozil, K.: Optimal tests of quantum nonlocality. Phys. Rev. A 64(014102) arXiv:quant-ph/0011060 (2001)
27. De Simone C. (1990) Lifting facets of the cut polytope. Oper. Res. Lett. 9(5): 341-344
28. Werner, R.F., Wolf, M.M.: All-multipartite Bell-correlation inequalities for two dichotomic observables per site. Phys. Rev. A 64(032112), arXiv:quant-ph/0102024 (2001)
29. Werner, R.F., Wolf, M.M.: Bell inequalities and entanglement. Quantum Information and Computation 1(3), 1-25, arXiv:quant-ph/0107093 (2001)
30. Ziegler G.M. (1998) Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, revised edn. Springer, Berlin Heidelberg New York
31. Żukowski, M., Brukner, Č.: Bell's theorem for general N-qubit states. Phys. Rev. Lett. 88(210401), arXiv:quant-ph/0102039 (2002)