Integral Boundary Points of Convex Polyhedra

DOI10.1007/978-3-540-68279-0_3zbMath1187.90012OpenAlexW86044744MaRDI QIDQ3565232

Joseph B. Kruskal, Alan J. Hoffman

Publication date: 3 June 2010

Published in: 50 Years of Integer Programming 1958-2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68279-0_3

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Collected or selected works; reprintings or translations of classics (01A75) History of operations research and mathematical programming (90-03)

Related Items (8)

Splitting a giant tour using integer linear programming ⋮ An efficient method for optimizing nested open pits with operational bottom space ⋮ On unimodular graphs with a unique perfect matching ⋮ The setup carryover assignment problem ⋮ On the Laplacian spread of digraphs ⋮ On the complexity of compressing two dimensional routing tables with order ⋮ Totally unimodular multistage stochastic programs ⋮ Deferred acceptance algorithm with retrade

This page was built for publication: Integral Boundary Points of Convex Polyhedra