Lifted Cover Inequalities for 0-1 Integer Programs: Computation

Lifted Cover Inequalities for 0-1 Integer Programs: Computation

We investigate the algorithmic and implementation issues related to the effective and efficient use of lifted cover inequalities and lifted GUB cover inequalities in a branch and cut algorithm for 0-1 integer programming. We have tried various strategies on several test problems and we identify the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:INFORMS journal on computing 1998-11, Vol.10 (4), p.427-437
Hauptverfasser: Gu, Zonghao, Nemhauser, George L, Savelsbergh, Martin W. P
Format: Artikel
Sprache:eng
Schlagworte:
0-1 integer programming
branch and cut
cover inequality
Integer Programming
lifting
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We investigate the algorithmic and implementation issues related to the effective and efficient use of lifted cover inequalities and lifted GUB cover inequalities in a branch and cut algorithm for 0-1 integer programming. We have tried various strategies on several test problems and we identify the best ones for use in practice.
ISSN:1091-9856
1526-5528
DOI:10.1287/ijoc.10.4.427