A general Hungarian method for the algebraic transportation problem
From MaRDI portal
Publication:1245143
DOI10.1016/0012-365X(78)90055-9zbMath0373.90047MaRDI QIDQ1245143
Publication date: 1978
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Perspectives of Monge properties in optimization, An algorithm for algebraic assignment problems, Duality for algebraic linear programming, Which matrices are immune against the transportation paradox?, Duality and admissible transformations in combinatorial optimization, Primal transportation and transshipment algorithms, An augmenting path method for solving linear bottleneck transportation problems, On scheduling multi-processor systems with algebraic objectives, An out-of-kilter method for the algebraic circulation problem
Cites Work
- Weakly admissible transformations for solving algebraic assignment and transportation problems
- An algebraic approach to assignment problems
- Some remarks on the time transportation problem
- Time‐minimizing transportation problems
- Bottleneck extrema
- Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”
- The bottleneck transportation problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
