Compact Linearization for Binary Quadratic Problems subject to Linear Equations


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

Similar works

Full text


computer science publication server

Last time updated on 10/02/2018

This paper was published in computer science publication server.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.