A faster polynomial algorithm for the unbalanced Hitchcock transportation problem

Operations Research Letters

Volumn 36, Issue 4, 2008, Pages 408-413

  Brenner, Ulrich ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Hitchcock transportation problem; Minimum cost flow problem

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; SCHEDULING ALGORITHMS;

HITCHCOCK TRANSPORTATION; NEW ALGORITHM; POLYNOMIAL ALGORITHMS; RUNNING TIME;

EVOLUTIONARY ALGORITHMS;

EID: 46449101715     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2008.01.011     Document Type: Article

References (21)

1. Adolphson D.L., and Thomas G.N. A linear time algorithm for a 2 × n transportation problem. SIAM Journal on Computing 6 (1977) 481-486
2. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows (1993), Prentice-Hall, Englewood Cliffs
3. Ahuja R.K., Orlin J.B., Stein C., and Tarjan R.E. Improved algorithms for bipartite network flow. SIAM Journal on Computing 23 (1994) 906-933
4. Balas E., and Zemel E. An algorithm for large zero-one knapsack problems. Operations Research 28 (1980) 1130-1154
5. Blum M., Floyd R.W., Pratt V., Rivest R.L., and Tarjan R.E. Time bounds for selection. Journal of Computer and System Science 7 (1973) 448-461
6. U. Brenner, M. Struzyna, 2005. Faster and better global placement by a new transportation algorithm, in: Proceedings of the 42nd Design Automation Conference, ACM 2005, pp. 591-596
7. Dyer M.E. An O (n) algorithm for the multiple-choice knapsack linear program. Mathematical Programming 29 (1984) 57-63
8. Ford L.R., and Fulkerson D.R. Flows in Networks (1962), Princeton University Press, Princeton
9. Goldberg A.V., and Tarjan R.E. Finding minimum-cost circulations by successive approximation. Mathematics of Operations Research 15 (1990) 430-466
10. Hochbaum D.S., and Woeginger G.J. An optimal algorithm for the bottleneck transportation problem with a fixed number of sources. Operations Research Letters 24 (1999) 25-28
11. m. SIAM Journal on Computing 7 (1978) 147-153
12. Klein M. A primal method for minimum cost flows, with applications to the assignment and transportation problems. Management Science 14 (1967) 205-220
13. Kleinschmidt H.P., and Schannath H. A strongly polynomial algorithm for the transportation problem. Mathematical Programming 68 (1995) 1-13
14. Korte B., and Vygen J. Combinatorial Optimization: Theory and Algorithms. 4th edition (2008), Springer, Berlin
15. Megiddo N., and Tamir A. Linear time algorithms for some separable quadratic programming problems. Operation Research Letters 13 (1993) 203-211
16. Orlin J.B. A faster strongly polynomial minimum cost flow algorithm. Operations Research 41 (1993) 338-350
17. T. Tokuyama, J Nakano, Geometric algorithms for a minimum cost assignment problem, in: Proceedings of the Seventh Symposium on Computational Geometry, 1991. pp. 262-271
18. Tokuyama T., and Nakano J. Efficient algorithms for the Hitchcock transportation problem. SIAM Journal on Computing 24 (1995) 563-578
19. J. Vygen, Plazierung in VLSI-Design und ein zweidimensionales Zerlegungsproblem, Doctoral Thesis, University of Bonn, 1996
20. Vygen J. Geometric quadrisection in linear time with application to VLSI placement. Discrete Optimization 2 (2005) 362-390
21. Zemel E. An O (n) algorithm for the linear multiple choice knapsack problem and related problems. Information Processing Letters 18 (1984) 123-128