Compact Linearization for Binary Quadratic Problems subject to Linear Equations

Mallach, Sven (2017) Compact Linearization for Binary Quadratic Problems subject to Linear Equations.
Technical Report , 10 p.

Abstract

In this paper it is shown that the compact linearization approach, that has been previously proposed only for binary quadratic problems with assignment constraints, can be generalized to arbitrary linear equations with positive coefficients which considerably enlarges its applicability. We discuss special cases of prominent quadratic combinatorial optimization problems where the obtained compact linearization yields a continuous relaxation that is provably as least as strong as the one obtained with an ordinary linearization.


Actions:
Full text not available from this repository.
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: UNSPECIFIED
Depositing User: Sven Mallach
Date Deposited: 22 Dec 2017 11:11
Last Modified: 22 Dec 2017 11:12
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/915