Polyhedral aspects of discrete optimization
DOI10.1007/BF01069163zbMath0534.90063MaRDI QIDQ3318542
Michail M. Kovalev, Vladimir A. Emelichev
Publication date: 1983
Published in: Cybernetics (Search for Journal in Brave)
diameterradiusskeletoninteger polyhedracombinatorially equivalent polyhedralinearization of Discrete Optimization problemsminimal representation of polyhedra
Integer programming (90C10) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Polytopes and polyhedra (52Bxx)
Related Items (2)
Cites Work
- The number of faces of a simplicial convex polytope
- The ellipsoid method and its consequences in combinatorial optimization
- Zur mathematischen theorie der optimalen standardisierung
- Sufficiency of McMullen’s conditions for 𝑓-vectors of simplicial polytopes
- The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Polyhedral aspects of discrete optimization