Primal transportation and transshipment algorithms
From MaRDI portal
Publication:3863694
DOI10.1007/BF01920269zbMath0426.90061MaRDI QIDQ3863694
Publication date: 1980
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
surveyassignment problemsprimal simplex algorithmcapacitated transshipment problemsprimal transportation algorithmssingle commodity network flow problemsspecialized solution methods
Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Solving a large scale districting problem: A case report ⋮ The quickest flow problem ⋮ An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem ⋮ Approximation of convex curves with application to the bicriterial minimum cost flow problem ⋮ Designing distribution systems with transport economies of scale ⋮ Planning harvesting and marketing activities for integrated fishing firms under an enterprise allocation scheme ⋮ Solving the transportation problem with mixed constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Integer programming and related areas. A classified bibliography
- An augmenting path method for solving linear bottleneck assignment problems
- A general Hungarian method for the algebraic transportation problem
- The generalized alternating path algorithm for transportation problems
- Integer programming and related areas. A classified bibliography 1976- 1978. Compiled at the Institut für Ökonometrie und Operations Research, University of Bonn
- On the use of tree indexing methods in transportation algorithms
- An augmenting path method for solving linear bottleneck transportation problems
- Transportation polytopes
- The Transhipment Problem
- A High-Speed Computer Technique for the Transportation Problem
- An Out-of-Kilter Method for Minimal-Cost Flow Problems
- Efficient computational devices for the capacitated transportation problem
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems
- An improved version of the out-of-kilter method and a comparative study of computer codes
- A Code for the Transportation Problem of Linear Programming
- Transportation problems with somexij negative and transshipment problems
- Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
- A network simplex method
- The zero pivot phenomenon in transportation and assignment problems and its computational implications
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Pivot Strategies for Primal-Simplex Network Codes
- The alternating basis algorithm for assignment problems
- A Variant Of The Primal Transportation Algorithm*
- Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
- New Finite Pivoting Rules for the Simplex Method
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Augmented Threaded Index Method For Network Optimization
- Coding the transportation problem
- Cycling in the transportation problem
- Another Enumeration of Trees
- The lower bounded and partial upper bounded distribution model
- The transportation paradox
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
- An Efficient Minimal Cost Flow Algorithm
- The lower bounded and partial upper bounded distribution model
- The bottleneck transportation problem
