Two classical transportation problems revisited: pure constant fixed charges and the paradox

DOI10.1016/j.mcm.2011.05.039zbMath1235.90029OpenAlexW2089500366MaRDI QIDQ409900

Van-Dat Cung, Susann Schrenk, Gerd Finke

Publication date: 15 April 2012

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2011.05.039

zbMATH Keywords

degeneracyfixed charge transportation problemtransportation paradox

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Avoiding unnecessary demerging and remerging of multi‐commodity integer flows ⋮ Fractional polynomial bounds for the fixed charge problem

Cites Work

• Unnamed Item
• Unnamed Item
• Which matrices are immune against the transportation paradox?
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Fixed-cost transportation problems
• Postoptimality Analyses of the Transportation Problem
• A Variant Of The Primal Transportation Algorithm^*
• The fixed charge problem
• The transportation paradox

This page was built for publication: Two classical transportation problems revisited: pure constant fixed charges and the paradox