Theoretical and computational study of several linearisation techniques for binary quadratic problems
SujetLinearisation techniques; Binary quadratic problems; Max cut problem; Quadratic knapsack problem; Quadratic stable set problem
Journal issueAnnals of Operations Research
MetadataShow full item record
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
994 Laboratoire d'Informatique de Paris-Nord [LIPN]
Abstract (EN)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.
Showing items related by title, author, creator and subject.
On the approximation of NP-complete problems by using Boltzmann machine method. The cases of some covering and packing problems Zissimopoulos, Vassilis; Paschos, Vangelis; Pekergin, Ferhan (1991) Communication / Conférence
Monnot, Jérôme; Toulouse, Sophie (2005) Communication / Conférence
Monnot, Jérôme; Toulouse, Sophie (2007) Communication / Conférence