Implementation and analysis of a variant of the dual method for the capacitated transshipment problem

DOI10.1016/0377-2217(80)90193-9zbMath0442.90100OpenAlexW1999172350MaRDI QIDQ1143947

David Whitman, Ronald D. Armstrong, Darwin D. Klingman

Publication date: 1980

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(80)90193-9

zbMATH Keywords

implementationcomputational analysisdual simplex methodalgorithmic performancecapacitated pure network problemcapacitated transshipment problemsensitivity of the implementation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05)

Related Items

A gradient driven transportation algorithm ⋮ Minimum-cost flow algorithms: an experimental evaluation

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the use of tree indexing methods in transportation algorithms
• Management Models and Industrial Applications of Linear Programming
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• 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
• An improved version of the out-of-kilter method and a comparative study of computer codes
• An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks
• 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
• An Improved Algorithm for Discrete $l_1 $ Linear Approximation

This page was built for publication: Implementation and analysis of a variant of the dual method for the capacitated transshipment problem