Theoretical and computational study of several linearisation techniques for binary quadratic problems
We perform a theoretical and computational study of the classical linearisation techniques (LT) and we propose a new LT for binary quadratic problems (BQPs). We discuss the relations between the linear programming (LP) relaxations of the considered LT for generic BQPs. We prove that for a specific class of BQP all the LTs have the same LP relaxation value. We also compare the LT computational performance for four different BQPs from the literature. We consider the Unconstrained BQP and the maximum cut of edge-weighted graphs and, in order to measure the effects of constraints on the computational performance, we also consider the quadratic extension of two classical combinatorial optimization problems, i.e., the knapsack and stable set problems.
KeywordsLinearisation techniques Binary quadratic problems Max cut problem Quadratic knapsack problem Quadratic stable set problem
Thanks are due to two anonymous referees for careful reading and useful comments.
- Forrester, R., & Greenberg, H. (2008). Quadratic binary programming models in computational biology. Algorithmic Operations Research, 3(2), 110–129.Google Scholar
- ILOG IBM. (2017). Cplex optimizer.Google Scholar
- Jaumard, B., Marcotte, O., & Meyer, C. (1998). Estimation of the Quality of Cellular Networks Using Column Generation Techniques. Cahiers du GÉRAD. Groupe d’études et de recherche en analyse des décisions.Google Scholar
- Sherali, H. D., & Adams, W. P. (1998). A reformulation-linearization technique for solving discrete and continuous nonconvex problems. Berlin: Springer.Google Scholar
- Wiegele, A. (2007). Biq mac library—A collection of max-cut and quadratic 01 programming instances of medium size. Technical report, Alpen-Adria-Universität Klagenfurt, Austria.Google Scholar