Degeneracy in transportation problems

DOI10.1016/0166-218X(86)90084-3zbMath0602.90095OpenAlexW1984845663MaRDI QIDQ1082263

Walter O. Rom, Ming S. Hung, Allan D. Waren

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(86)90084-3

zbMATH Keywords

transportationdegeneracycomputational experiencesgeneral purpose transshipment problem solverminimum and maximum number of vertices

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (4)

Degeneracy in transportation problems ⋮ Rational solution axioms and efficient sets ⋮ Empirical optimal transport on countable metric spaces: distributional limits and statistical applications ⋮ Combinatoric classes of the transportation problem and their properties

Cites Work

• Unnamed Item
• Unnamed Item
• Degeneracy in transportation problems
• Some NP-complete problems in linear programming
• Transportation polytopes
• A network simplex method
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• The alternating basis algorithm for assignment problems
• Theoretical Properties of the Network Simplex Method

This page was built for publication: Degeneracy in transportation problems