Cutting planes from a mixed integer Farkas lemma.

DOI10.1016/j.orl.2003.08.003zbMath1043.90057OpenAlexW2003447661WikidataQ124962584 ScholiaQ124962584MaRDI QIDQ1426721

Matthias Köppe, Robert Weismantel

Publication date: 15 March 2004

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2003.08.003

zbMATH Keywords

Cutting planesLattice basesMixed-integer linear programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05)

Related Items

Feasible rounding approaches for equality constrained mixed-integer optimization problems ⋮ A constructive characterization of the split closure of a mixed integer linear program ⋮ Theorems of the alternative for conic integer programming ⋮ Valid inequalities for mixed integer linear programs ⋮ Superadditive characterizations of pure integer programming feasibility ⋮ Integer Farkas Lemma

Cites Work

• Unnamed Item
• Unnamed Item
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms