Experimental comparisons of codes for long transportation problems
From MaRDI portal
Publication:1086155
DOI10.1016/0305-0548(85)90036-XzbMath0608.90068MaRDI QIDQ1086155
Publication date: 1985
Published in: Computers \& Operations Research (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the use of tree indexing methods in transportation algorithms
- A Code for the Transportation Problem of Linear Programming
- Technical Note—A Special Case of the Transportation Problem
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Coding the transportation problem
- A method for the solution of transportation problems with tall matrices
- The assignment problem with three job categories
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
This page was built for publication: Experimental comparisons of codes for long transportation problems
