An algorithm for determining the minimal convex subset that contains all the integer points of a convex polyhedral set

DOI10.1016/0895-7177(94)00168-5MaRDI QIDQ1344644zbMATH OpenOpenAlexFDO

Authors J. B. Hughes

Publication date 13 February 1995

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0895-7177(94)00168-5

zbMATH Keywords

integer points of a convex polyhedral setminimal convex subsetseparating hyperplanes

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10)

Recommendations

• Computing the integer hull of convex polyhedral sets
• Some properties of convex hulls of integer points contained in general convex sets
• Computing an integer point of a class of convex sets.
• Algorithm for maximizing a linear function on the set of integral points of a convex polyhedron
• How to find the convex hull of all integer points in a polyhedron?

Cited in

(4)

• A general algorithm for determining all essential solutions and inequalities for any convex polyhedron
• Algorithm for maximizing a linear function on the set of integral points of a convex polyhedron
• scientific article; zbMATH DE number 4115425 (Why is no real title available?)
• Computing an integer point of a class of convex sets.

This page was built for publication: An algorithm for determining the minimal convex subset that contains all the integer points of a convex polyhedral set

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