The Integer Hull of a Convex Rational Polytope

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

Jean-Bernard Lasserre

Publication date: 18 March 2011

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

Mathematics Subject Classification ID

52B20: Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry)

90C10: Integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

Related Items

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