Efficient Algorithms for the Hitchcock Transportation Problem
- 1 June 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (3) , 563-578
- https://doi.org/10.1137/s0097539792236729
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Geometric algorithms for the minimum cost assignment problemRandom Structures & Algorithms, 1995
- Improved Algorithms for Bipartite Network FlowSIAM Journal on Computing, 1994
- Splitting a configuration in a simplexAlgorithmica, 1993
- Chapter II Linear programmingPublished by Elsevier ,1989
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithmMathematical Programming, 1986
- A strongly polynomial minimum cost circulation algorithmCombinatorica, 1985
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972