Combinatoric classes of the transportation problem and their properties

DOI10.1007/BF02096260zbMath0794.90037MaRDI QIDQ1312755

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

Publication date: 7 February 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

adjacency relationsdegeneracy hyperplanes

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Unnamed Item
• Degeneracy in transportation problems
• Perron eigenvectors and the symmetric transportation polytope
• Some NP-complete problems in linear programming
• The assignment game. I: The core
• Transportation polytopes
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• Faces of dual transportation polyhedra
• The Hirsch Conjecture for Dual Transportation Polyhedra
• A network simplex method
• New Finite Pivoting Rules for the Simplex Method
• Theoretical Properties of the Network Simplex Method
• Optimality and Degeneracy in Linear Programming

This page was built for publication: Combinatoric classes of the transportation problem and their properties