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-5zbMATH Open0818.90081OpenAlexW1973176015MaRDI QIDQ1344644

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

separating hyperplanesinteger points of a convex polyhedral setminimal convex subset

Mathematics Subject Classification ID

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

Related Items (1)

A general algorithm for determining all essential solutions and inequalities for any convex polyhedron

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)