Extending the QCR method to general mixed-integer programs

Mathematical Programming

Volumn 131, Issue 1-2, 2012, Pages 381-401

  Billionnet, Alain ^a   Elloumi, Sourour ^b   Lambert, Amélie ^b  

^a ENSIIE   (France)

^b CEDRIC CNAM   (France)

Author keywords

Convex reformulation; Experiments; General integer programming; Mixed integer programming; Quadratic programming; Semi definite programming

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; CONTINUOUS RELAXATION; CONVEX OBJECTIVES; CONVEX REFORMULATION; CPU TIME; EQUALITY CONSTRAINTS; INEQUALITY CONSTRAINT; LINEAR CONSTRAINTS; MIXED INTEGER; MIXED INTEGER QUADRATIC PROGRAM; MIXED-INTEGER PROGRAMMING; MIXED-INTEGER PROGRAMS; QUADRATIC FUNCTION; SDP RELAXATION; SEMI-DEFINITE PROGRAMMING;

ALGORITHMS; CONSTRAINT THEORY; CONVEX PROGRAMMING; EXPERIMENTS; LINEAR PROGRAMMING; QUADRATIC PROGRAMMING;

INTEGER PROGRAMMING;

EID: 84857631394     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-010-0381-7     Document Type: Article

References (26)

1. Audet C.; Hansen P.; Savard G.: Essays and Surveys in Global Optimization. GERAD 25th Anniversary Series, Springer, New York (2005)
2. A. Billionnet S. Elloumi 2007 Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem Math. Program. 109 55 68 2294034 05131059 10.1007/s10107-005-0637-9 (Pubitemid 44874466)
3. A. Billionnet S. Elloumi M.-C. Plateau 2009 Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: the QCR method Discrete Appl. Math. 157 6 1185 1197 2502437 1169.90405 10.1016/j.dam.2007.12.007
4. P. Bonami L. Biegler A. Conn G. Cornuéjols I. Grossmann C. Laird J. Lee A. Lodi F. Margot N. Sawaya A. Waechter 2005 An algorithmic framework for convex mixed integer nonlinear programming Discrete Optim. 5 186 204 10.1016/j.disopt.2006.10.011
5. B. Borchers 1999 CSDP, A C library for semidefinite programming Optim. Methods Softw. 11 1 613 623 1778432 10.1080/10556789908805765
6. A. Caprara 2008 Constrained 0-1 quadratic programming: basic approaches and extensions Eur. J. Oper. Res. 187 3 1494 1503 2378346 1138.90455 10.1016/j.ejor.2006.09.028 (Pubitemid 350236651)
7. Y. Cui 2005 Dynamic programming algorithms for the optimal cutting of equal rectangles Appl.Math. Model. 29 1040 1053 1163.90779 10.1016/j.apm.2005. 02.007 (Pubitemid 41447941)
8. Floudas C.A.: Deterministic Global Optimization. Kluwer, Dordrecht (2000)
9. A. Faye F. Roupin 2007 Partial lagrangian relaxation for general quadratic programming, 4' OR Q. J. Oper. Res. 5 1 75 88 2305509 1142.90025 10.1007/s10288-006-0011-7
10. A. Frangioni C. Gentile 2006 Perspective cuts for a class of convex 0-1 mixed integer programs Math. Program. 106 225 236 2208082 1134.90447 10.1007/s10107-005-0594-3 (Pubitemid 43177353)
11. H.L. Fu L. Shiue X. Cheng D.Z. Du J.M. Kim 2001 Quadratic integer programming with application in the chaotic mappings of complete multipartite graphs J. Optim. Theory Appl. 110 3 545 556 1854015 1064.90028 10.1023/A:1017584227417
12. Garey M.R.; Johnson D.S.: Computers and Intractability: a guide to the theory of NP-Completness. W.H. Freeman, San Francisco (1979)
13. F. Glover R.E. Woolsey 1974 Converting the 0-1 polynomial programming problem to a 0-1 linear program Oper. Res. 22 180 182 0272.90049 10.1287/opre.22.1.180
14. F. Glover 1975 Improved linear integer programming formulations of nonlinear integer problems Manag. Sci. 22 455 460 401138 10.1287/mnsc.22.4.455
15. P.L. Hammer A.A. Rubin 1970 Some remarks on quadratic programming with 0-1 variables Revue Française d'Informatique et de Recherche Opérationnelle. 4 3 67 79 274033
16. C. Helmberg F. Rendl 1998 Solving quadratic (0,1)-problems by semidefinite programs and cutting planes Math. Program. 82 291 315 1639622 0919.90112 (Pubitemid 128388096)
17. Z.S. Hua P. Banerjee 2000 Aggregate line capacity design for PWB assembly systems Int. J. Prod. Res. 38 11 2417 2441 0973.90507 10.1080/00207540050031841 (Pubitemid 35401834)
18. ILOG. ILOG CPLEX 11.0 Reference Manual. ILOG CPLEX Division, Gentilly (2008)
19. F. Körner 1986 A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm Optimization. 17 643 648 858311 0617.90067 10.1080/02331938608843180
20. F. Körner 1983 An efficient branch and bound algorithm to solve the quadratic integer programming problem Computing. 30 253 260 703773 0494.65035 10.1007/BF02253896 (Pubitemid 13576278)
21. Liberti L.; Maculan N.: Global Optimization: From Theory to Implementation, Chapter: Nonconvex Optimization and Its Applications. Springer, New York (2006)
22. G.P. McCormick 1976 Computability of global solutions to factorable non-convex programs: part I-convex underestimating problems Math. Program. 10 1 147 175 469281 0349.90100 10.1007/BF01580665
23. Saxena A.; Bonami P.; Lee J.: Disjunctive Cuts for Non-Convex Mixed Integer Quadratically Constrained Programs. IPCO, Bologna (2008)
24. H.D. Sherali W.P. Adams 1986 A tight linearization and an algorithm for zero-one quadratic programming problems Manage. Sci. 32 10 1274 1290 861711 0623.90054 10.1287/mnsc.32.10.1274
25. M. Tawarmalani N.V. Sahinidis 2004 Global optimization of mixed-integer nonlinear programs: a theoretical and computational study Math. Program. 99 3 563 591 2051712 1062.90041 10.1007/s10107-003-0467-6 (Pubitemid 40871718)
26. Tawarmalani M.; Sahinidis N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming. Kluwer, Dordrecht (2002)