Two classical transportation problems revisited: pure constant fixed charges and the paradox
DOI10.1016/J.MCM.2011.05.039zbMATH Open1235.90029OpenAlexW2089500366MaRDI QIDQ409900FDOQ409900
Authors: Susann Schrenk, Gerd Finke, Van-Dat Cung
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- The fixed charge problem
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Fixed-cost transportation problems
- Which matrices are immune against the transportation paradox?
- Postoptimality Analyses of the Transportation Problem
- Title not available (Why is that?)
- A Variant Of The Primal Transportation Algorithm*
- Title not available (Why is that?)
- The transportation paradox
Cited In (2)
This page was built for publication: Two classical transportation problems revisited: pure constant fixed charges and the paradox
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409900)