The Integer Hull of a Convex Rational Polytope

DOI10.1007/3-540-44842-X_88zbMath1327.52022OpenAlexW4240828731MaRDI QIDQ3082975

Jean-Bernard Lasserre

Publication date: 18 March 2011

Published in: Computational Science and Its Applications — ICCSA 2003 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-44842-x_88

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (2)

On the combinatorial structure of chromatic scheduling polytopes ⋮ A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems

This page was built for publication: The Integer Hull of a Convex Rational Polytope