An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems
From MaRDI portal
Publication:1186949
DOI10.1016/0167-6377(91)90072-WzbMath0744.90064OpenAlexW1968311755MaRDI QIDQ1186949
Publication date: 28 June 1992
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(91)90072-w
Integer programming (90C10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
On the role of bottleneck Monge matrices in combinatorial optimization ⋮ Perspectives of Monge properties in optimization ⋮ A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources ⋮ An instant solution of the \(2\times n\) bottleneck transportation problem
Cites Work
- Finding the median
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- An augmenting path method for solving linear bottleneck transportation problems
- On the computational power of pushdown automata
- Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
- Some remarks on the time transportation problem
- Time‐minimizing transportation problems
- Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”
- The bottleneck transportation problem
