Economics at your fingertips  

Compact linearization for binary quadratic problems subject to assignment constraints

Sven Mallach ()
Additional contact information
Sven Mallach: Universität zu Köln

4OR, 2018, vol. 16, issue 3, 295-309

Abstract: Abstract We introduce and prove new necessary and sufficient conditions to carry out a compact linearization approach for a general class of binary quadratic problems subject to assignment constraints that has been proposed by Liberti (4OR 5(3):231–245, 2007, ). The new conditions resolve inconsistencies that can occur when the original method is used. We also present a mixed-integer linear program to compute a minimally sized linearization. When all the assignment constraints have non-overlapping variable support, this program is shown to have a totally unimodular constraint matrix. Finally, we give a polynomial-time combinatorial algorithm that is exact in this case and can be used as a heuristic otherwise.

Keywords: Non-linear programming; Binary quadratic programming; Mixed-integer programming; Linearization; 68R01; 90C05; 90C09; 90C10; 90C11; 90C20; 90C30 (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations: Track citations by RSS feed

Downloads: (external link) Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link:

Ordering information: This journal article can be ordered from
https://www.springer ... ch/journal/10288/PSE

Access Statistics for this article

4OR is currently edited by Yves Crama, Michel Grabisch and Silvano Martello

More articles in 4OR from Springer
Bibliographic data for series maintained by Sonal Shukla ().

Page updated 2019-11-06
Handle: RePEc:spr:aqjoor:v:16:y:2018:i:3:d:10.1007_s10288-017-0364-0