@inproceedings{3348d8254b7e423cab3521713553c472,

title = "Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms",

abstract = "We study the mixed 0-1 knapsack polytope, which is defined by a single knapsack constraint that contains 0-1 and bounded continuous variables. We develop a lifting theory for the continuous variables. In particular, we present a pseudo-polynomial algorithm for the sequential lifting of the continuous variables. We introduce the concept of superlinear inequalities and show that our lifting scheme can be significantly simplified for them. Finally, we show that superlinearity results can be generalized to nonsuperlinear inequalities when the coefficients of the continuous variables lifted are large.",

author = "Richard, {Jean Philippe P.} and {De Farias}, {Ismael R.} and Nemhauser, {George L.}",

year = "2002",

doi = "10.1007/3-540-47867-1_12",

language = "English",

isbn = "9783540478676",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "161--175",

editor = "Cook, {William J.} and Schulz, {Andreas S.}",

booktitle = "Integer Programming and Combinatorial Optimization - 9th International IPCO 2002 Conference, Proceedings",

note = "null ; Conference date: 27-05-2002 Through 29-05-2002",

}