An efficient primal approach to bottleneck transportation problems

DOI10.1002/NAV.3800300103zbMATH Open0521.90076OpenAlexW2136330424MaRDI QIDQ3671756FDOQ3671756

Authors: Parviz Partow-Navid, Robert A. Russell, Darwin D. Klingman 

Publication date: 1983

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

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

zbMATH Keywords

comparison of algorithmscomputational testingbottleneck linear programmingcapacitated and constrained bottleneck transportation problemsextended threaded index methodminmax solutionspseudopricing procedure

Mathematics Subject Classification ID

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

Cites Work

• Time‐minimizing transportation problems
• Solving singularly constrained generalized network problems

Cited In (4)

• An extension to the single bottleneck transportation problem
• The multiple bottleneck transportation problem
• Chance constrained bottleneck transportation problem with preference of routes
• Risk-control approach for bottleneck transportation problem with randomness and fuzziness

This page was built for publication: An efficient primal approach to bottleneck transportation problems

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