@inbook{8221d5584b4e4eba87b68a14bfcf7bc0,

title = "A simplex-based algorithm for 0-1 mixed integer programming",

abstract = "We present a finitely convergent cutting plane algorithm for 0-1 mixed integer programming. The algorithm is a hybrid between a strong cutting plane and a Gomory-type algorithm that generates violated facet-defining inequalities of a relaxation of the simplex tableau and uses them as cuts for the original problem. We show that the cuts can be computed in polynomial time and can be embedded in a finitely convergent algorithm.",

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

year = "2003",

doi = "10.1007/3-540-36478-1_15",

language = "English",

isbn = "3540005803",

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

publisher = "Springer-Verlag",

pages = "158--170",

editor = "Michael Junger and Gerhard Reinelt and Giovanni Rinaldi",

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

}