Topics of polyhedral combinatorics in transportation problems with exclusions

DOI10.1007/BF01069494zbMath0748.90043OpenAlexW2030826043MaRDI QIDQ4007415

M. K. Kravtsov

Publication date: 27 September 1992

Published in: Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

complexity boundstransportation polyhedradiameter of \(k\)-regular TPsgiven number of facesmulticriterion transportation problems

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (2)

Completeness of vector discrete optimization problems ⋮ Complexity of discrete multicriteria problems

Cites Work

• Solvability of transportation problems with exclusions
• The Hirsch Conjecture for Dual Transportation Polyhedra
• Polyhedral aspects of discrete optimization
• A proof of the maximal diameter conjecture for the transportation polyhedron
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Topics of polyhedral combinatorics in transportation problems with exclusions