Minimal-cost network flow problems with variable lower bounds on arc flows

Computers and Operations Research

Volumn 38, Issue 8, 2011, Pages 1210-1218

  Zhu, Xiaoyan ^a   Yuan, Qi ^a   Garcia Diaz, Alberto ^a   Dong, Liang ^b  

^a University of Tennessee Knoxville   (United States)

^b Research Group   (United States)

Author keywords

Generalized network; Minimal cost network flow; Network optimization; Variable lower bound

Indexed keywords

ARC FLOW; COMPUTATIONAL TESTING; DISTINCTIVE FEATURES; FLOW DISTRIBUTION; GENERALIZED NETWORKS; LARGE SIZES; LOWER AND UPPER BOUNDS; LOWER BOUNDS; MINIMAL COST; MIXED INTEGER LINEAR PROGRAMMING; NETWORK FLOW PROBLEMS; NETWORK OPTIMIZATION; NEW MODEL; NP-HARD; NUMERICAL EXAMPLE; UPPER BOUND; ZERO FLOW;

COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION;

COSTS;

EID: 78650513359     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.11.006     Document Type: Article

References (44)

1. D.P. Bertsekas, and P. Tseng Relaxation methods for minimum cost ordinary and generalized network flow problems Oper Res 36 1 1988 93 114
2. Wayne KD. A polynomial combinatorial algorithm for generalized minimum cost flow. In: Proceedings of the 31st annual ACM symposium on theory of computing, 1999. p. 118.
3. Orlin JB. A faster strongly polynomial minimum cost flow algorithm. In: Proceedings of the 20th annual ACM symposium on theory of computing, 1988. p. 37787.
4. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin Network flows: theory, algorithms, and applications 1993 Prentice-Hall Englewood Cliffs, NJ
5. M. Klein A primal method for minimum cost flows, with applications to the assignment and transportation problems Manage Sci 14 1967 205 220
6. M. Iri A new method for solving transportation-network problems J Oper Res Soc Jpn 3 1960 27 87
7. L.R. Ford, and D.R. Fulkerson A primaldual algorithm for the capacitated Hitchcock problem Nav Res Logist Q 4 1957 47 54
8. L.R. Ford, and D.R. Fulkerson Flows in networks 1962 Princeton University Press Princeton, NJ
9. D.R. Fulkerson An Out-of-Kilter method for minimal cost flow problems SIAM J Appl Math 9 1961 18 27
10. J. Edmonds, and R.M. Karp Theoretical improvements in algorithmic efficiency for network flow problems J ACM 19 1972 248 264
11. H. Rck Scaling techniques for minimal cost network flows V. Page, Discrete structures and algorithms 1980 Carl Hanser Munich 181 191
12. R.K. Ahuja, A.V. Goldberg, J.B. Orlin, and R.E. Tarjan Finding minimum-cost flows by double scaling Math Program 53 3 1992 243 266
13. Goldberg AV, Tarjan RE. Finding minimum-cost circulations by canceling negative cycles. MIT/LCS/TM-334, 1987, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA.
14. Goldberg AV, Tardos E, Tarjan R. Network flow algorithm. Technical report 860. School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1989.
15. D.T. Phillips, and A. Garcia-Diaz Fundamentals of network analysis. International series in industrial and systems engineering 1981 Prentice-Hall Englewood Cliffs, NJ
16. Dantzig GB. Application of the simplex method to a transportation problem. Activity analysis of production and allocation. Cowles Commission Monograph 13, 1951.
17. E. Johnson Networks and basic solutions Oper Res 14 1966 619 623
18. M.S. Bazaraa, and J.J. Jarvis Linear programming and network flows 1977 Wiley New York
19. J.L. Kennington, and R.V. Helgason Algorithms for network programming 1980 Wiley New York
20. G.H. Bradley, G.G. Brown, and G.W. Graves Design and implementation of large scale primal transshipment algorithms Manage Sci 24 1 1977 1 34
21. J.J. Mulvey Pivot strategies for primalsimplex network codes J ACM 25 2 1978 266 270
22. R.K. Ahuja, D.S. Hochbaum, and J.B. Orlin Solving the convex cost integer dual network flow problem Manage Sci 49 7 2003 950 964
23. J.B. Orlin Minimum convex cost dynamic network flows Math Oper Res 9 2 1984 190 207
24. A. Weintraub A primal algorithm to solve network flow problems with convex costs Manage Sci 21 1 1974 87 97
25. A. Amiri, and H. Pirkul New formulation and relaxation to solve a concavecost network flow problem J Oper Res Soc 48 3 1997 278 297
26. R.E. Erickson, C.L. Monma, and A.F. Veinott Send-and-split method for minimumconcavecost network flows Math Oper Res 12 4 1987 634 664
27. C.L. Monma, and M. Segal A primal algorithm for finding minimumcost flows in capacitated networks with applications Bell Syst Tech J 61 1982 949 968
28. T.L. Magnanti, and R.T. Wong Network design and transportation planning: models and algorithms Transport Sci 18 1983 1 55
29. W.I. Zangwill Minimum concave cost flows in certain networks Manage Sci 14 7 1968 429 450
30. M.M. Connors, and W.I. Zangwill Cost minimization in networks with discrete stochastic requirements Oper Res 19 3 1970 794 821
31. J. Figueira, H.M. Silti, and P. Tolla Using mathematical programming heuristics in a multicriteria network flow context J Oper Res Soc 49 1998 878 885
32. M. Ghatee, and S.M. Hashemi Application of fuzzy minimum cost flow problems to network design under uncertainty Fuzzy Set Syst 160 22 2009 3263 3289
33. H.-S. Shih, and E.S. Lee Fuzzy multi-level minimum cost flow problems Fuzzy Set Syst 107 2 1999 159 176
34. J. Geunes, and P.M. Pardalos Supply chain optimization 2005 Springer Berlin
35. A.V. Cabot, and S.S. Erenguc Some branch and bound procedures for fixed-cost transportation problems Nav Res Logist Q 31 1984 145 154
36. U.S. Palekar, M.H. Karwan, and S. Zionts A branch-and-bound method for the fixed charge transportation problem Manage Sci 36 9 1990 1092 1105
37. F. Ortega, and L.A. Wolsey A branch-and-cut algorithm for the single-commodity, uncapacitated fixed-charge network flow problem Networks 41 3 2003 143 158
38. F.R.B. Cruz, J.M. Smith, and G.R. Mateus Solving to optimality the uncapacitated fixed-charge network flow problem Comput Oper Res 25 1 1998 67 81
39. A.M. Costa A survey on benders decomposition applied to fixed-charge network design problems Comput Oper Res 32 6 2005 1429 1450
40. M. Sun, and P.G. McKeown Tabu search applied to the general fixed charge problem Ann Oper Res 41 14 1993 405 420
41. W.E. Walker A heuristic adjacent extreme point algorithm for the fixed charge problem Manage Sci 22 5 1976 587 596
42. Garcia-Diaz A, Kim SB, Sawhney R. Optimal procedures for minimizing commodity distribution costs in networks with conditional arc lower bounds. In: Proceedings of the 2008 industrial engineering research conference, 2008. Paper no. 285.
43. Kim S. A network transformation procedure for finding minimal-cost flows in networks with variable lower bounds. Thesis (MS), INEN Department, Texas A&M University, College Station, TX, 1991.
44. ILOG. ILOG CPLEX 11.0 user's manual, 2007.