On the Polyhedrality of the Convex Hull of the Feasible Set of an Integer Program
From MaRDI portal
Publication:4171871
DOI10.1137/0316044zbMath0389.90074MaRDI QIDQ4171871
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
Related Items
An Algorithm for solving the Integer Linear Fractional Programs, Equivalent constraints for discrete sets, A characterization of minimal valid inequalities for mixed integer programs, On the convex hull of feasible solutions to certain combinatorial problems