An augmenting path method for solving linear bottleneck transportation problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3594538 (Why is no real title available?)
- scientific article; zbMATH DE number 3625114 (Why is no real title available?)
- A general Hungarian method for the algebraic transportation problem
- A note on two problems in connexion with graphs
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
- Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
- An augmenting path method for solving linear bottleneck assignment problems
- Bottleneck extrema
- On some techniques useful for solution of transportation network problems
- Quicksort
- Some remarks on the time transportation problem
- The bottleneck transportation problem
- Time‐minimizing transportation problems
- Weakly admissible transformations for solving algebraic assignment and transportation problems
Cited in
(9)- On the bottleneck linear programming problem
- A time minimising transportation problem with quantity dependent time
- Primal transportation and transshipment algorithms
- Efficiency and time-cost-tradeoffs in transportation problems
- An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems
- A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
- An algorithm for algebraic assignment problems
- On trade-off solution pairs in a special type of transportation problem
- Duality and admissible transformations in combinatorial optimization
This page was built for publication: An augmenting path method for solving linear bottleneck transportation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1254950)
