A characterization of minimal valid inequalities for mixed integer programs

DOI10.1016/0167-6377(82)90048-7zbMath0486.90066OpenAlexW2055287160MaRDI QIDQ1165157

Ellis L. Johnson, Rainer Schrader, Achim Bachem

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0167-6377(82)90048-7

zbMATH Keywords

value functionscharacterization of minimal valid inequalitiesmaster problem frameworkunderlying subadditive function

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11)

Related Items

On sublinear inequalities for mixed integer conic programs, Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations, Cut-Generating Functions for Integer Variables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal inequalities
• Minimal Inequalities and Subadditive Duality
• On the existence of optimal solutions to integer and mixed-integer programming problems
• On the Polyhedrality of the Convex Hull of the Feasible Set of an Integer Program
• Some continuous functions related to corner polyhedra, II