Abstract
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelling salesman polytope (TSP). Prominent examples are the quadratic assignment problem and the quadratic knapsack problem; further applications occur in various areas such as production planning or automatic graph drawing. In order to apply branch-and-cut methods for the exact solution of such problems, the objective function has to be linearized. However, the standard linearization usually leads to very weak relaxations. On the other hand, problem-specific polyhedral studies are often time-consuming. Our goal is the design of general separation routines that can replace detailed polyhedral studies of the resulting polytope and that can be used as a black box. As unconstrained binary quadratic optimization is equivalent to the maximum-cut problem, knowledge about cut polytopes can be used in our setting. Other separation routines are inspired by the local cuts that have been developed by Applegate, Bixby, Chvátal and Cook for faster solution of large-scale traveling salesman instances. Finally, we apply quadratic reformulations of the linear constraints as proposed by Helmberg, Rendl and Weismantel for the quadratic knapsack problem. By extensive experiments, we show that a suitable combination of these methods leads to a drastic speedup in the solution of constrained quadratic 0–1 problems. We also discuss possible generalizations of these methods to arbitrary non-linear objective functions.
Similar content being viewed by others
References
Adams W.P., Sherali H.D.: A tight linearization and an algorithm for zero-one quadratic programming problems. Manag. Sci. 32(10), 1274–1290 (1986)
Adams W.P., Sherali H.D.: Linearization strategies for a class of zero-one mixed integer programming problems. Oper. Res. 38(2), 217–226 (1990)
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)
Barahona F., Mahjoub A.: On the cut polytope. Math. Program. 36, 157–173 (1986)
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)
Buchheim C., Liers F., Oswald M.: Local cuts revisited. Oper. Res. Lett. 36, 430–433 (2008)
Buchheim C., Rinaldi G.: Efficient reduction of polynomial zero-one optimization to the quadratic case. SIAM J. Optim. 18(4), 1398–1413 (2007)
Buchheim C., Rinaldi G.: Terse integer linear programs for boolean optimization. J. Satisf. Boolean Model. Comput. 6, 121–139 (2009)
Buchheim C., Wiegele A., Zheng L.: Exact algorithms for the quadratic linear ordering problem. INFORMS J. Comput. 22(1), 168–177 (2010). doi:10.1287/ijoc.1090.0318
Burkard R.E., Karisch S.E., Rendl F.: QAPLIB—a quadratic assignment problem library. J. Glob. Optim. 10(4), 391–403 (1997)
Caprara A.: Constrained 0–1 quadratic programming: basic approaches and extensions. Eur. J. Oper. Res. 187(3), 1494–1503 (2008)
De Simone C.: The cut polytope and the Boolean quadric polytope. Discret. Math. 79, 71–75 (1990)
Deza M., Laurent M.: Geometry of Cuts and Metrics, Algorithms and Combinatorics, vol. 15. Springer, Berlin (1997)
Hammer P.L.: Some network flow problems solved with pseudo-boolean programming. Oper. Res. 13, 388–399 (1965)
Hansen P., Meyer C.: Improved compact linearizations for the unconstrained quadratic 0–1 minimization problem. Discret. Appl. Math. 157(6), 1267–1290 (2009)
Helmberg C., Rendl F., Weismantel R.: A semidefinite programming approach to the quadratic knapsack problem. J. Comb. Optim. 4(2), 197–215 (2000)
Johnson, T.A.: New Linear-Programming based Solution Procedures for the Quadratic Assignment Problem. Ph.D. thesis, Graduate School of Clemson University (1992)
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)
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)
Author information
Authors and Affiliations
Corresponding author
Additional information
Financial support from the German Science Foundation is acknowledged under contracts Bu 2313/1-1 and Li 1675/1-1. Partially supported by the Marie Curie RTN Adonet 504438 funded by the EU. A preliminary version of this paper appeared in the proceedings of WEA 2008 [5].
Rights and permissions
About this article
Cite this article
Buchheim, C., Liers, F. & Oswald, M. Speeding up IP-based algorithms for constrained quadratic 0–1 optimization. Math. Program. 124, 513–535 (2010). https://doi.org/10.1007/s10107-010-0377-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-010-0377-3
Keywords
- Quadratic programming
- Maximum-cut problem
- Local cuts
- Quadratic knapsack
- Crossing minimization
- Similar subgraphs