Polyhedral aspects of discrete optimization

DOI10.1007/BF01069163MaRDI QIDQ3318542zbMATH OpenFDO

Authors Michail M. Kovalev, V. A. Emelichev

Publication date 1983

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01069163

zbMATH Keywords

combinatorially equivalent polyhedradiameterinteger polyhedralinearization of Discrete Optimization problemsminimal representation of polyhedraradiusskeleton

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10)

Recommendations

• Polyhedral Combinatorics in Combinatorial Optimization
• scientific article; zbMATH DE number 919758
• scientific article; zbMATH DE number 4187465
• scientific article; zbMATH DE number 3902672
• The problem of intractability and analysis of heuristics in discrete optimization. I

Cites work

• scientific article; zbMATH DE number 3817419 (Why is no real title available?)
• scientific article; zbMATH DE number 3821442 (Why is no real title available?)
• scientific article; zbMATH DE number 3726086 (Why is no real title available?)
• scientific article; zbMATH DE number 3616451 (Why is no real title available?)
• scientific article; zbMATH DE number 3311484 (Why is no real title available?)
• scientific article; zbMATH DE number 3371825 (Why is no real title available?)
• scientific article; zbMATH DE number 3371826 (Why is no real title available?)
• Sufficiency of McMullen’s conditions for 𝑓-vectors of simplicial polytopes
• The ellipsoid method and its consequences in combinatorial optimization
• The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4
• The number of faces of a simplicial convex polytope
• Zur mathematischen theorie der optimalen standardisierung

Cited in

(10)

• Computing the discrete compactness of orthogonal pseudo-polytopes via their nD-EVM representation
• Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets
• scientific article; zbMATH DE number 3851019 (Why is no real title available?)
• scientific article; zbMATH DE number 3902672 (Why is no real title available?)
• Gradient methods of maximization of convex functions on discrete structures
• Topics of polyhedral combinatorics in transportation problems with exclusions
• scientific article; zbMATH DE number 1379519 (Why is no real title available?)
• scientific article; zbMATH DE number 911850 (Why is no real title available?)
• Polyhedra and optimization in connection with a weak majorization ordering
• POLYHEDRA AND OPTIMIZATION RELATED TO A WEAK ABSOLUTE MAJORIZATION ORDERING

This page was built for publication: Polyhedral aspects of discrete optimization

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