Speeding up IP-based algorithms for constrained quadratic 0-1 optimization

Mathematical Programming

Volumn 124, Issue 1-2, 2010, Pages 513-535

  Buchheim, Christoph ^a   Liers, Frauke ^b   Oswald, Marcus ^c  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF COLOGNE   (Germany)

^c UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

Crossing minimization; Local cuts; Maximum cut problem; Quadratic knapsack; Quadratic programming; Similar subgraphs

Indexed keywords

BLACK BOXES; BRANCH-AND-CUT; CONSTRAINED QUADRATIC 0-1 PROBLEM; CROSSING MINIMIZATION; EXACT SOLUTION; GRAPH DRAWING; LINEAR CONSTRAINTS; NONLINEAR OBJECTIVE FUNCTIONS; OBJECTIVE FUNCTIONS; POLYHEDRAL STUDIES; POLYTOPES; PRODUCTION PLANNING; QUADRATIC ASSIGNMENT PROBLEMS; QUADRATIC KNAPSACK PROBLEMS; QUADRATIC OPTIMIZATION; SUBGRAPHS; TRAVELING SALESMAN; TRAVELLING SALESMAN;

CONSTRAINED OPTIMIZATION; DRAWING (GRAPHICS); HIGHWAY ACCIDENTS; INTEGER PROGRAMMING; LINEARIZATION; PRODUCTION CONTROL; TOPOLOGY;

QUADRATIC PROGRAMMING;

EID: 77955173251     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-010-0377-3     Document Type: Article

References (19)

1. W.P. Adams H.D. Sherali 1986 A tight linearization and an algorithm for zero-one quadratic programming problems Manag. Sci. 32 10 1274 1290 0623.90054 10.1287/mnsc.32.10.1274 861711
2. W.P. Adams H.D. Sherali 1990 Linearization strategies for a class of zero-one mixed integer programming problems Oper. Res. 38 2 217 226 0724.90046 10.1287/opre.38.2.217 1051064
3. Applegate, A., Bixby, R., Chvátal, V., Cook, W.: TSP cuts which do not conform to the template paradigm. In: Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions, Lecture Notes in Computer Science, vol. 2241, pp. 261-304. Springer (2001)
4. F. Barahona A. Mahjoub 1986 On the cut polytope Math. Program. 36 157 173 0616.90058 10.1007/BF02592023 866986
5. Buchheim, C., Liers, F., Oswald, M.: A basic toolbox for constrained quadratic 0/1 optimization. In: McGeoch, C.C. (ed.) WEA 2008: Workshop on Experimental Algorithms, Lecture Notes in Computer Science, vol. 5038, pp. 249-262. Springer (2008)
6. C. Buchheim F. Liers M. Oswald 2008 Local cuts revisited Oper. Res. Lett. 36 430 433 1155.90480 10.1016/j.orl.2008.01.004 2437266
7. C. Buchheim G. Rinaldi 2007 Efficient reduction of polynomial zero-one optimization to the quadratic case SIAM J. Optim. 18 4 1398 1413 1165.90685 10.1137/050646500 2373307
8. C. Buchheim G. Rinaldi 2009 Terse integer linear programs for boolean optimization J. Satisf. Boolean Model. Comput. 6 121 139 1180.90193 2569112
9. C. Buchheim A. Wiegele L. Zheng 2010 Exact algorithms for the quadratic linear ordering problem INFORMS J. Comput. 22 1 168 177 10.1287/ijoc.1090.0318 10.1287/ijoc.1090.0318
10. R.E. Burkard S.E. Karisch F. Rendl 1997 QAPLIB-a quadratic assignment problem library J. Glob. Optim. 10 4 391 403 0884.90116 10.1023/A:1008293323270 1457185
11. A. Caprara 2008 Constrained 0-1 quadratic programming: basic approaches and extensions Eur. J. Oper. Res. 187 3 1494 1503 1138.90455 10.1016/j.ejor.2006.09.028 2378346 (Pubitemid 350236651)
12. C. De Simone 1990 The cut polytope and the Boolean quadric polytope Discret. Math. 79 71 75 0683.90068 10.1016/0012-365X(90)90056-N 1032635
13. Deza M., Laurent M.: Geometry of Cuts and Metrics, Algorithms and Combinatorics, vol. 15. Springer, Berlin (1997)
14. P.L. Hammer 1965 Some network flow problems solved with pseudo-boolean programming Oper. Res. 13 388 399 10.1287/opre.13.3.388 184728
15. P. Hansen C. Meyer 2009 Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem Discret. Appl. Math. 157 6 1267 1290 1178.90251 10.1016/j.dam.2007.12.008 2502443
16. C. Helmberg F. Rendl R. Weismantel 2000 A semidefinite programming approach to the quadratic knapsack problem J. Comb. Optim. 4 2 197 215 0970.90075 10.1023/A:1009898604624 1772826
17. Johnson, T.A.: New Linear-Programming based Solution Procedures for the Quadratic Assignment Problem. Ph.D. thesis, Graduate School of Clemson University (1992)
18. Liers F., Jünger M., Reinelt G., Rinaldi G.: Computing Exact Ground States of Hard Ising Spin Glass Problems by Branch-and-Cut. New Optimization Algorithms in Physics, pp. 47-68. Wiley, Weinheim (2004)
19. Rendl, F., Rinaldi, G., Wiegele, A.: A branch and bound algorithm for Max-Cut based on combining semidefinite and polyhedral relaxations. In: Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 4513, pp. 295-309. Springer, Berlin (2007)