Convex normalizations in lift-and-project methods for 0-1 programming

Branch-and-Cut algorithms for general 0-1 mixed integer programs can be successfully implemented by using Lift-and-Project (L&P) methods to generate cuts. L&P cuts are drawn from a cone of valid inequalities that is unbounded and, thus, needs to be truncated, or "normalized". We co...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Annals of operations research 2002-10, Vol.116 (1), p.91
Hauptverfasser:	Rey, Pablo A, Sagastizabal, Claudia A
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Computer programming Convex analysis Integer programming Linear programming Operations research Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!