On three basic methods for solving bottleneck transportation problems

DOI10.1002/nav.3800290312zbMath0512.90074OpenAlexW1967910533MaRDI QIDQ3657782

Ulrich Derigs

Publication date: 1982

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800290312

zbMATH Keywords

computational experiencebottleneck transportation problemprimal methodsHungarian method, shortest augmenting path method

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)

Related Items (6)

On bilevel fractional programming ⋮ Efficiency and time-cost-tradeoffs in transportation problems ⋮ Quadratic bottleneck problems ⋮ A polynomial algorithm for a two-stage time minimizing transportation problem. ⋮ Bottleneck flows in unit capacity networks ⋮ Selected bibliography on degeneracy

Cites Work

• Unnamed Item
• Weakly admissible transformations for solving algebraic assignment and transportation problems
• Time‐minimizing transportation problems
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems

This page was built for publication: On three basic methods for solving bottleneck transportation problems