On the Polyhedrality of the Convex Hull of the Feasible Set of an Integer Program

DOI10.1137/0316044zbMATH Open0389.90074OpenAlexW2072927730MaRDI QIDQ4171871FDOQ4171871

Authors: Robert R. Meyer, Michael L. Wage 

Publication date: 1978

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0316044

Mathematics Subject Classification ID

Integer programming (90C10) Polytopes and polyhedra (52Bxx)

Cited In (4)

• Equivalent constraints for discrete sets
• On the convex hull of feasible solutions to certain combinatorial problems
• A characterization of minimal valid inequalities for mixed integer programs
• An Algorithm for solving the Integer Linear Fractional Programs

This page was built for publication: On the Polyhedrality of the Convex Hull of the Feasible Set of an Integer Program

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4171871)