Cuts for conic mixed-integer programming

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

Volumn 4513 LNCS, Issue , 2007, Pages 16-29

  Atamtürk, Alper ^a   Narayanan, Vishnu ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

Branch and cut; Conic programming; Integer programming

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; ONLINE SEARCHING; PROBLEM SOLVING; TREES (MATHEMATICS);

CONIC PROGRAMMING; INTEGRALITY GAPS; PROBABILISTIC INTEGER PROGRAMMING; STATISTICAL LEARNING;

INTEGER PROGRAMMING;

EID: 38049076370     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72792-7_2     Document Type: Conference Paper

References (33)

1. F. Alizadeh. Interior point methods in semidefinite programming and applications to combinatorial optimization. SIAM Journal on Optimization, 5:13-51, 1995.
2. P. Alizadeh and D. Goldfarb. Second-order cone programming. Mathematical Programming, 95:3-51, 2003.
3. A. Atamtiirk. Sequence independent lifting for mixed-integer programming. Operations Research, 52:487-490, 2004.
4. E. Balas. Disjunctive programming. Annals of Discrete Mathematics, 5:3-51, 1979.
5. E. Balas, S. Ceria, and G. Cornuéjols. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming, 58:295-324, 1993.
6. A. Ben-Tal and A. Nemirovski. Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. SIAM, 2001.
7. S. J. Benson and Y. Ye. DSDP5: Software for semidefinite programming. Technical Report ANL/MCS-P1289-0905, Mathematics and Computer Science Division, Argonne National Laboratory, September 2005.
8. P. Bonami, L. T. Biegler, A. R. Conn, G. Cornuéjols, Grossmann I. E, C. D. Laird, J. Lee, A. Lodi, F. Margot, N. Sawaya, and A. Wächter. An algorithmic framework for convex mixed integer nonlinear programs. Technical Report RC23771, IBM, November 2005.
9. B. Borchers. CDSP, a C library for semidefinite programing. Optimization Methods and Software, 11:613-623, 1999.
10. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, Cambridge, 2004.
11. M. T. Çezik and G. Iyengar. Cuts for mixed 0-1 conic programming. Mathematical Programming, 104:179-202, 2005.
12. M. X. Goemans. Semidefinite programming in combinatorial optimization. Mathematical Programming, 79:143-161, 1997.
13. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfyibility problems using semidefinite programming. Journal of the ACM, 42:1115-1145, 1995.
14. S. Kim, M. Kojima, and M. Yamashita. Second order cone programming relaxation of a positive semidefinite constraint. Optimization Methods and Software, 18:535-451, 2003.
15. M. Kojima and L. Tuncel. Cones of matrices and successive convex relaxations of nonconvex sets. SIAM Journal on Optimization, 10:750-778, 2000.
16. J. B. Lasserre. An explicit exact SDP relaxation for nonlinear 0-1 programs. In K. Aardal and A. M. H. Gerards, editors, Lecture Notes in Computer Science, volume 2081, pages 293-303. 2001.
17. J. Linderoth. A simplical branch-and-bound algorithm for solving quadratically constrained quadratic programs. Mathematical Programming, 103:251-282, 2005.
18. M. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret. Applications of second-order cone programming. Linear Algebra and its Applications, 284:193-228, 1998.
19. L. Lovász and A. Schrijver. Cones of matrices and set-functions and 0-1 optimization. SIAM Journal on Optimization, 1:166-190, 1991.
20. G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley and Sons, New York, 1988.
21. G. L. Nemhauser and L. A. Wolsey. A recursive procedure for generating all cuts for 0-1 mixed integer programs. Mathematical Programming, 46:379-390, 1990.
22. Y. Nesterov and A. Nemirovski. A general approach to polynomial-time algorithm design for convex programming. Technical report, Center. Econ. & Math. Inst, USSR Acad. Sci., Moskow, USSR, 1988.
23. Y. Nesterov and A. Nemirovski. Self-concordant functions and polynomial time methods in convex programming. Technical report, Center. Econ. & Math. Inst, USSR Acad. Sci., Moskow, USSR, 1990.
24. Y. Nesterov and A. Nemirovski. Conic formulation of a convex programming problem and duality. Technical report, Center. Econ. & Math. Inst, USSR Acad. Sci., Moskow, USSR, 1991.
25. Y. Nesterov and A. Nemirovski. Interior-point polynomial algorithms for convex programming. SIAM, Philedelphia, 1993.
26. H. D. Sherali and C. Shetti. Optimization with disjunctive constraints, volume 181 of Lectures on Econ. Math. Systems. Springer Verlag, Berlin, Heidelberg, New York, 1980.
27. H. D. Sherali and C. H. Tunçbilek. A hierarchy of relaxations between continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics, 3:411-430, 1990.
28. H. D. Sherali and C. H. Tunçbilek. A reformulation-convexification approach for solving nonconvex quadratic programming problems. Journal of Global Optimization, 7:1-31, 1995.
29. R. Stubbs and S. Mehrotra. A branch-and-cut methods for 0-1 mixed convex programming. Mathematical Programming, 86:515-532, 1999.
30. J. Sturm. Using SeDuMi 1.02, a MATLAB toolbox for ptimization over symmetric cones. Optimization Methods and Software, 11:625-653, 1999.
31. M. Tawarmalani and N. V. Sahinidis. Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Mathematical Programming, 99:563-591, 2004.
32. K.C. Toh, M. J. Todd, and R. H. Tütüncü. SDPT3 - a Matlab software package for semidefinite programming. Optimization Methods and Software, 11/12:545-581, 1999.
33. M. Yamashita, K. Fujisawa, and M. Kojima. Implementation and evaluation of SDPA 6.0 (SemiDefinite Programming Algorithm 6.0). Optimization Methods and Software, 18:491-505, 2003.