An augmenting path method for solving linear bottleneck transportation problems

DOI10.1007/BF02246556zbMath0399.90095MaRDI QIDQ1254950

Ulrich Derigs, Uwe T. Zimmermann

Publication date: 1979

Published in: Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Related Items

An algorithm for algebraic assignment problems, A time minimising transportation problem with quantity dependent time, On the bottleneck linear programming problem, Efficiency and time-cost-tradeoffs in transportation problems, An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems, Duality and admissible transformations in combinatorial optimization, Primal transportation and transshipment algorithms, On trade-off solution pairs in a special type of transportation problem, A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources

Uses Software

• Quicksort

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• An augmenting path method for solving linear bottleneck assignment problems
• A general Hungarian method for the algebraic transportation problem
• Weakly admissible transformations for solving algebraic assignment and transportation problems
• Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
• Some remarks on the time transportation problem
• Time‐minimizing transportation problems
• Bottleneck extrema
• On some techniques useful for solution of transportation network problems
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
• The bottleneck transportation problem
• Quicksort