Upper and lower bound results on the convex hull of integer points in polyhedra

DOI10.1112/S0025579300006665zbMath0760.90072MaRDI QIDQ4009230

D. A. Morgan

Publication date: 27 September 1992

Published in: Mathematika (Search for Journal in Brave)

zbMATH Keywords

upper boundlower boundnumber of verticesknapsack polytope

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (1)

On the number of irreducible points in polyhedra

Cites Work

• The vertices of the knapsack polytope
• On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint
• On the Product of Three Homogeneous Linear Forms
• On the Product of Three Homogeneous Linear Forms (II)

This page was built for publication: Upper and lower bound results on the convex hull of integer points in polyhedra