Primal simplex network codes: State‐of‐the‐art implementation technology
- 1 December 1978
- Vol. 8 (4), 315-339
- https://doi.org/10.1002/net.3230080405
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Solving multicommodity transportation problems using a primal partitioning simplex techniqueNaval Research Logistics Quarterly, 1977
- A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation ProblemManagement Science, 1976
- Past, present and future of large scale transshipment computer codes and applicationsComputers & Operations Research, 1975
- Real World Applications of Network Related Problems and Breakthroughs in Solving Them EfficientlyACM Transactions on Mathematical Software, 1975
- Efficient computational devices for the capacitated transportation problemNaval Research Logistics Quarterly, 1974
- Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost network flow problemsNetworks, 1974
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation AlgorithmJournal of the ACM, 1973
- A partitioning algorithm for the multicommodity network flow problemMathematical Programming, 1972
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution ProblemsJournal of the ACM, 1972
- A generalized upper bounding algorithm for multicommodity network flow problemsNetworks, 1971