Fast algorithms for specially structured minimum cost flow problems with applications

Operations Research

Volumn 58, Issue 6, 2010, Pages 1681-1696

  Vaidyanathan, Balachandran ^a   Ahuja, Ravindra K ^b  

^a Operations Research   (United States)

^b J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AIRLINE SCHEDULING; CONGESTION PRICING; COUNTERCLOCKWISE DIRECTIONS; DEMAND NODE; FAST ALGORITHMS; MINIMUM COST; MINIMUM COST FLOW PROBLEM; PRODUCTION PLANNING; RAIL FREIGHT CARS; RIVER TRANSPORTATION; SHORTEST PATH ALGORITHMS; SPECIAL STRUCTURE;

AIR TRANSPORTATION; ALGORITHMS; COST ACCOUNTING; DATA STRUCTURES; FREIGHT TRANSPORTATION; HIGHWAY PLANNING; PRODUCTION CONTROL; TRAFFIC CONGESTION;

COSTS;

EID: 78651443619     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1100.0846     Document Type: Article

References (19)

1. Aggarwal, A., A. Bar-Noy, S. Khuller, D. Kravets, B. Schieber. 1995. Efficient minimum cost matching and transportation using the quadrangle inequality. J. Algorithms 19(1) 116-143.
2. Ahuja, R. K., D. S. Hochbaum. 2008. Solving linear cost dynamic lot sizing problems in O(nlogn) time. Oper Res. 56(1) 255-261.
3. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ.
4. Ahuja, R. K., J. Liu, J. B. Orlin, D. Sharma, L. A. Shughart. 2005. Solving real-life locomotive scheduling problems. Transportation Sci. 39(4) 503-517.
5. Atamturk, A., D. S. Hochbaum. 2001. Capacity acquisition, subcontracting, and lot sizing. Management Sci. 47(8) 1081-1100.
6. Busaker, R. G., P. J. Gowen. 1961. A procedure for determining minimal-cost network flow patterns. O.R.O. Technical Report 15, Operational Research Office, Johns Hopkins University, Baltimore.
7. Ford, L. R., D. R. Fulkerson. 1962. Flows in Networks. Princeton University Press, Princeton, NJ.
8. Iri, M. 1960. A new method of solving transportation-network problems. J. Oper. Res. Soc. Japan 3 27-87.
9. Jewell, W. S. 1958. Optimal flow through networks. Interim Technical Report 8, Operations Research Center, Massachusetts Institute of Technology, Cambridge.
10. Karp, R. M., S. Y. R. Li. 1975. Two special cases of the assignment problem. Discrete Math. 13(2) 129-142.
11. Klein, M. 1967. A primal method for minimal cost flows with applications to the assignment and transportation problems. Management Sci. 14(3) 205-220.
12. Orlin, J. B. 1993. A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41(2) 338-350.
13. Romeijn, H. E., D. Romero Morales. 2003. An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case. Naval Res. Logist. 50(5) 412-437.
14. Sedeño-Noda, A., J. Gutierrez, B. Abdul-Jalbar, J. Sicilia. 2004. An O(Tlog T) algorithm for the dynamic lot size problem with limited storage and linear costs. Comput. Optim. Appl. 28(3) 311-323.
15. Szwarc, W. 1975. Instant transportation solutions. Naval Res. Logist. Quart. 22(3) 427-440.
16. Vaidyanathan, B., R. K. Ahuja, J. B. Orlin. 2008a. The locomotive routing problem. Transportation Sci. 42(4) 492-507.
17. Vaidyanathan, B., R. K. Ahuja, J. Liu, L. A. Shughart. 2008b. Real-life locomotive planning: New formulations and computational results. Transportation Res. Part B 42(2) 147-168.
18. Wagelmans, A., S. Van Hoesel, A. Kolen. 1992. Economic lot sizing: An O(nlogn) algorithm that runs in linear time in the Wagner-Whitin case. Oper. Res. 40(1) S145-S156.
19. Wagner, H. M., T. M. Whitin. 1958. Dynamic version of the economic lot size model. Management Sci. 5(1) 89-96.