Integral boundary points of convex polyhedra
From MaRDI portal
Publication:3565232
DOI10.1007/978-3-540-68279-0_3zbMATH Open1187.90012OpenAlexW86044744MaRDI QIDQ3565232FDOQ3565232
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
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
Combinatorial optimization (90C27) Collected or selected works; reprintings or translations of classics (01A75) History of operations research and mathematical programming (90-03)
Cited In (14)
- Deferred acceptance algorithm with retrade
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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 boundary arcs joining antipodal points of a planar convex body
- Fair division with allocator's preference
- Totally unimodular multistage stochastic programs
- Splitting a giant tour using integer linear programming
- On the Laplacian spread of digraphs
- On the complexity of compressing two dimensional routing tables with order
- A generalization of Robacker's theorem
- Efficient sensitivity analysis for parametric robust Markov chains
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)
