On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint
From MaRDI portal
Publication:5607018
DOI10.1287/opre.18.5.940zbMath0206.48901MaRDI QIDQ5607018
Publication date: 1970
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.18.5.940
Related Items
On integer points in polyhedra, On integer points in polyhedra: A lower bound, On algorithms for discrete problems, Upper and lower bound results on the convex hull of integer points in polyhedra, On the existence of optimal solutions to integer and mixed-integer programming problems, Improved integer programming bounds using intersections of corner polyhedra