Convex Normalizations in Lift-and-Project Methods for 0–1 Programming

Pablo Rey () and Claudia Sagastizábal ()

Annals of Operations Research, 2002, vol. 116, issue 1, 112 pages

Abstract: 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 consider general normalizations defined by arbitrary closed convex sets and derive dual problems for generating L&P cuts. This unified theoretical framework generalizes and covers a wide group of already known normalizations. We also give conditions for proving finite convergence of the cutting plane procedure that results from using such general L&P cuts. Copyright Kluwer Academic Publishers 2002

Keywords: Lift-and-Project; disjunctive cuts; Branch-and-Cut; cutting planes; 0–1 integer programming (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1021320028145 (text/html)
Access to full text is restricted to subscribers.

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: https://EconPapers.repec.org/RePEc:spr:annopr:v:116:y:2002:i:1:p:91-112:10.1023/a:1021320028145

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1021320028145

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().