On three basic methods for solving bottleneck transportation problems

DOI10.1002/NAV.3800290312MaRDI QIDQ3657782zbMATH OpenOpenAlexFDO

Authors 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

bottleneck transportation problemprimal methodscomputational experienceHungarian method, shortest augmenting path method

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3775260 (Why is no real title available?)
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
• Time‐minimizing transportation problems
• Weakly admissible transformations for solving algebraic assignment and transportation problems

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3657782)