Integral boundary points of convex polyhedra

DOI10.1007/978-3-540-68279-0_3MaRDI QIDQ3565232zbMATHOpenAlexFDO

Authors Alan J. Hoffman, Joseph B. Kruskal

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)

Recommendations

• Algorithm for maximizing a linear function on the set of integral points of a convex polyhedron
• Enumerating vertices of \(0/1\)-polyhedra associated with \(0/1\)-totally unimodular matrices
• Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
• On integer points in polyhedra
• scientific article; zbMATH DE number 1234104

Cited in

(14)

• scientific article; zbMATH DE number 958438 (Why is no real title available?)
• 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
• Fair division with allocator's preference
• The setup carryover assignment problem
• On the Laplacian spread of digraphs
• Deferred acceptance algorithm with retrade
• On boundary arcs joining antipodal points of a planar convex body
• Efficient sensitivity analysis for parametric robust Markov chains
• A generalization of Robacker's theorem
• On the complexity of compressing two dimensional routing tables with order
• scientific article; zbMATH DE number 2186578 (Why is no real title available?)
• Totally unimodular multistage stochastic programs

This page was built for publication: Integral boundary points of convex polyhedra

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