On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint

DOI10.1287/opre.18.5.940zbMath0206.48901OpenAlexW1985130235MaRDI QIDQ5607018

David S. Rubin

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

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items (8)

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 ⋮ On integer points in polyhedra ⋮ On the polyhedral complexity of the integer points in a hyperball ⋮ On integer points in polyhedra: A lower bound ⋮ Some theoretical challenges in digital geometry: a perspective ⋮ On algorithms for discrete problems

This page was built for publication: On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint