Cutting planes for mixed 0-1 semidefinite programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2081, Issue , 2001, Pages 251-263

  Iyengar, G ^a   Cezik M T ^b  

^a Columbia University ^*  (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 23044528010     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45535-3_20     Document Type: Conference Paper

References (20)

1. F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim., 5(1):13-51, 1995.
2. E. Balas. Disjunctive programming. Annals of Discrete Mathematics, 5:3-51, 1979.
3. E. Balas, S. Ceria, and G. Cornuejols. A list-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming, 58:295-324, 1993.
4. E. Balas, S. Ceria, and G. Cornuejols. Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Management Science, 42:1229-1246, 1996.
5. S. Benson, Y. Ye, and X. Zhang. Solving large-scale sparse semidefinite programs for combinatorial optimization. Tech. Rep., Dept of Mgmt Sc., Univ. of Iowa, 1997.
6. M. T. Cezik. Semidefinite methods for the traveling salesman and other combinatorial problems. PhD thesis, IEOR Dept., Columbia University, 2000.
7. C. Choi and Y. Ye. Solving sparse semideinite programs using dual scaling algorithm with an iterative solver. Tech. Rep., Dept. of Mgmt. Sc., Univ. of Iowa, 2000.
8. D. Cvetkovic, M. Cangalovic, and V. Kovacevic-Vujcic Semidefinite programming methods for the symmetric TSP. In IPCO VII, p. 126-136. Springer, Berlin, 1999.
9. M. Goemans and F. Rendl. Combinatorial optimization. In Handbook ofSemidef-inite Programming: Theory, Algorithms and Applications. Kluwer, 2000.
10. M. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisiability problems using semideinite programming. Journal of ACM, 42:1115-1145, 1995.
11. L. Lovasz. Combinatorial Problems and Exercises. North-Holland, 1979.
12. L. Lovasz and A. Schrijver. Cones of matrices and set-functions and 0-1 optimization. SIAM Journal ofControl and Optimization, 1(2):166-190, 1991.
13. J. E. Mitchell and B. Borchers. Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm. In High performance optimization, pages 349-366. Kluwer Acad. Publ., Dordrecht, 2000.
14. Y. Nesterov and A. Nemirovskii. Interior-point polynomial algorithms in convex programming. SIAM, Philadelphia, 1993.
15. G. Pataki. Cone-lp's and semidefinite programs: geometry and simplex-type method. In Lecture Notes in Computer Science, v. 1084, p. 162-174, 1996.
16. H. Sherali and W. Adams. A heirarchy of relaxations and convex hull representations for mixed zero-one programming problems. Tech. Rep., Virginia Tech., 1989.
17. R. A. Stubbs and S. Mehrotra. A branch-and-cut method for 0-1 mixed convex programming. Mathematical Programming, 86:515-532, 1999.
18. J. Sturm. Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optimization Methods and Software, 11-12:625-653, 1999.
19. TSPLIB: A library of sample instances for the TSP and related problems. Available at http://www.crpc.rice.edu/softlib/tsplib/.
20. W. Wolkowicz, R. Saigal, and L. Vandenberghe, editors. Handbook of Semidefinite Programming. Kluwer Acad. Publ., 2000.