Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications

References

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