An instant solution of the \(2\times n\) bottleneck transportation problem

DOI10.1016/0167-6377(93)90091-TzbMath0795.90044OpenAlexW1993450076MaRDI QIDQ1318660

Wlodzimierz Szwarc

Publication date: 6 April 1994

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(93)90091-t

zbMATH Keywords

bottleneck transportationnorth west corner rule

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (2)

Perspectives of Monge properties in optimization ⋮ A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources

Cites Work

• An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems
• Letter to the Editor—The Initial Solution of the Transportation Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An instant solution of the \(2\times n\) bottleneck transportation problem