MINIMUM COST NETWORK FLOWS: PROBLEMS, ALGORITHMS, AND SOFTWARE

Abstract : We present a wide range of problems concerning minimum cost network flows, and  give an overview of the classic linear single-commodity Minimum Cost Network Flow Problem (MCNFP) and some other closely related problems, either tractable or intractable. We also discuss state-of-the-art algorithmic approaches and recent advances in the solution methods for the MCNFP. Finally, optimization software packages for the MCNFP are presented. Keywords : Mathematical Programming, Combinatorial Optimization, Optimization Software. MSC: 65K05, 90C27, 90B10.

[1]  Chak-Kuen Wong,et al.  Time-varying minimum cost flow problems , 2001, Eur. J. Oper. Res..

[2]  Antonio Sedeño-Noda,et al.  An algorithm for the biobjective integer minimum cost flow problem , 2001, Comput. Oper. Res..

[3]  Eric. Thibault.  A decision support system for the design of cost-effective metropolitan area networks. , 1999 .

[4]  Nicos Christofides,et al.  A Branch-and-Bound Algorithm for Concave Network Flow Problems , 2006, J. Glob. Optim..

[5]  Matthieu van der Heijden,et al.  Practical extensions to a minimum cost flow model for level of repair analysis , 2011, Eur. J. Oper. Res..

[6]  P. Beraldi,et al.  Parallel Algorithms for Solving the Convex Minimum Cost Flow Problem , 2001, Comput. Optim. Appl..

[7]  Andrew V. Goldberg,et al.  An efficient implementation of a scaling minimum-cost flow algorithm , 1993, IPCO.

[8]  Horst W. Hamacher,et al.  Capacity inverse minimum cost flow problem , 2010, J. Comb. Optim..

[9]  Hylton Boothroyd.  Operational Research '90 , 1992 .

[10]  Jafar Razmi,et al.  A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem , 2009, Adv. Eng. Softw..

[11]  J. Edmonds,et al.  A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[12]  James B. Orlin,et al.  Parallel algorithms for the assignment and minimum-cost flow problems , 1993, Oper. Res. Lett..

[13]  Mauricio G. C. Resende,et al.  Fortran subroutines for network flow optimization using an interior point algorithm , 2008 .

[14]  Angelo Sifaleras,et al.  On a dual network exterior point simplex type algorithm and its computational behavior , 2012, RAIRO Oper. Res..

[15]  Panos M. Pardalos,et al.  Mathematical Aspects of Network Routing Optimization , 2011 .

[16]  Richard S. Barr,et al.  Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup , 1994, Oper. Res..

[17]  Panos M. Pardalos,et al.  Minimum concave-cost network flow problems: Applications, complexity, and algorithms , 1991 .

[18]  Angelo Sifaleras,et al.  An Agricultural Decision Support System for Optimal Land Use Regarding Groundwater Vulnerability , 2010, Int. J. Inf. Syst. Soc. Chang..

[19]  Ebrahim Nasrabadi,et al.  Minimum cost time-varying network flow problems , 2010, Optim. Methods Softw..

[20]  Éva Tardos,et al.  A strongly polynomial minimum cost circulation algorithm , 1985, Comb..

[21]  Krishnaiyan Thulasiraman,et al.  Parallel network dual simplex method on a shared memory multiprocessor , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

[22]  Antonio Frangioni,et al.  A Computational Study of Cost Reoptimization for Min-Cost Flow Problems , 2006, INFORMS J. Comput..

[23]  R. Weiner.  Lecture Notes in Economics and Mathematical Systems , 1985 .

[24]  Peter Värbrand,et al.  Strongly polynomial algorithm for two special minimum concave cost network flow problems , 1995 .

[25]  Antonio Sedeño-Noda,et al.  The biobjective minimum cost flow problem , 2000, Eur. J. Oper. Res..

[26]  Nicos Christofides,et al.  A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems , 2006, Eur. J. Oper. Res..

[27]  Andreou Dimitrios,et al.  Application of a New Network-enabled Solver for the Assignment Problem in Computer-aided Education , 2005 .

[28]  Sean B. Eom,et al.  A survey of decision support system applications (1988–1994) , 1998, J. Oper. Res. Soc..

[29]  R.J.I. Basten,et al.  A Minimum Cost Flow model for Level of Repair Analysis , 2008 .

[30]  Boris Goldengorin,et al.  Handbook of combinatorial optimization , 2013 .

[31]  S. M. Hashemi,et al.  Generalized minimal cost flow problem in fuzzy nature: An application in bus network planning problem , 2008 .

[32]  Zoltán Király,et al.  Efficient implementations of minimum-cost flow algorithms , 2012, ArXiv.

[33]  Dimitri P. Bertsekas,et al.  RELAX-IV : a faster version of the RELAX code for solving minimum cost flow problems , 1994 .

[34]  Gang Yu,et al.  System Operations Advisor: A Real-Time Decision Support System for Managing Airline Operations at United Airlines , 1996 .

[35]  Angelo Sifaleras,et al.  An exterior simplex type algorithm for the Minimum Cost Network Flow Problem , 2009, Comput. Oper. Res..

[36]  M. Minoux.  Solving integer minimum cost flows with separable convex cost objective polynomially , 1986 .

[37]  Jason Papathanasiou,et al.  Optimization Theory, Decision Making, and Operations Research Applications : Proceedings of the 1st International Symposium and the 10th Balkan Conference on Operational Research , 2013 .

[38]  Dingzhu Du,et al.  Network Optimization Problems: Algorithms, Applications And Complexity , 1993 .

[39]  William H. Cunningham,et al.  A network simplex method , 1976, Math. Program..

[40]  Kevin D. Wayne,et al.  A polynomial combinatorial algorithm for generalized minimum cost flow , 1999, STOC '99.

[41]  Darwin Klingman,et al.  Enhancements of Spanning Tree Labeling Procedures for Network Optimization. , 1979 .

[42]  James B. Orlin,et al.  A polynomial time primal network simplex algorithm for minimum cost flows , 1996, SODA '96.

[43]  Jeffrey L. Arthur,et al.  An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions , 1994, Networks.

[44]  Panos M. Pardalos,et al.  Interior point algorithms for network flow problems , 1996 .

[45]  Andrew V. Goldberg,et al.  Finding minimum-cost flows by double scaling , 2015, Math. Program..

[46]  Liang Dong,et al.  Minimal-cost network flow problems with variable lower bounds on arc flows , 2011, Comput. Oper. Res..

[47]  Mehdi Ghatee,et al.  Application of fuzzy minimum cost flow problems to network design under uncertainty , 2009, Fuzzy Sets Syst..

[48]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[49]  Donald Goldfarb,et al.  A new scaling algorithm for the minimum cost network flow problem , 1999, Oper. Res. Lett..

[50]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[51]  Balachandran Vaidyanathan,et al.  Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications , 2010, Oper. Res..

[52]  Mauricio G. C. Resende,et al.  An Efficient Implementation of a Network Interior Point Method , 1991, Network Flows And Matching.

[53]  Sang M. Lee,et al.  A Survey of Decision Support System Applications (1971–April 1988) , 1990 .

[54]  Péter Kovács,et al.  LEMON - an Open Source C++ Graph Template Library , 2011, WGT@ETAPS.

[55]  David Haro,et al.  A Model for Solving the Optimal Water Allocation Problem in River Basins with Network Flow Programming When Introducing Non-Linearities , 2012, Water Resources Management.

[56]  Sven Oliver Krumke,et al.  Minimum cost flows with minimum quantities , 2011, Inf. Process. Lett..

[57]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[58]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[59]  Horst W. Hamacher,et al.  Multiple objective minimum cost flow problems: A review , 2007, Eur. J. Oper. Res..

[60]  Longcheng Liu,et al.  Inverse minimum cost flow problems under the weighted Hamming distance , 2010, Eur. J. Oper. Res..

[61]  Robert E. Tarjan,et al.  Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..

[62]  E. Stanley Lee,et al.  Fuzzy multi-level minimum cost flow problems , 1999, Fuzzy Sets Syst..

[63]  E. Kim,et al.  A survey of decision support system applications (1995–2001) , 2006, J. Oper. Res. Soc..

[64]  Ebrahim Nasrabadi,et al.  Combinatorial algorithms for the minimum interval cost flow problem , 2006, Appl. Math. Comput..

[65]  Angelo Sifaleras,et al.  On the initialization methods of an exterior point algorithm for the assignment problem , 2010, Int. J. Comput. Math..

[66]  Jens Vygen,et al.  On dual minimum cost flow algorithms , 2002, Math. Methods Oper. Res..

[67]  Cheng Xu,et al.  The fractional minimal cost flow problem on network , 2011, Optim. Lett..

[68]  Angelo Sifaleras,et al.  An empirical study on factors influencing the effectiveness of algorithm visualization , 2013, Comput. Appl. Eng. Educ..

[69]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[70]  James B. Orlin,et al.  A faster strongly polynomial minimum cost flow algorithm , 1993, STOC '88.

[71]  Carlos A. Arreola-Morales.  International Business Machines Corporation (IBM) , 2014 .

[72]  Panos M. Pardalos,et al.  Handbook of Optimization in Complex Networks , 2012 .

[73]  Mauro Dell'Amico,et al.  Assignment Problems , 1998, IFIP Congress: Fundamentals - Foundations of Computer Science.

[74]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[75]  Charalampos P. Triantafyllidis,et al.  A PRIMAL-DUAL EXTERIOR POINT ALGORITHM FOR LINEAR PROGRAMMING PROBLEMS , 2009 .

[76]  A. Löbel.  Solving Large-Scale Real-World Minimum-Cost Flow Problems by a Network Simplex Method , 1996 .

[77]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[78]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[79]  Jörg Peters,et al.  The network simplex method on a multiprocessor , 1990, Networks.

[80]  Antonio Sedeño-Noda,et al.  The biobjective undirected two-commodity minimum cost flow problem , 2005, Eur. J. Oper. Res..

[81]  Mohsen Alimomeni,et al.  A note on the minimum interval cost flow problem , 2011, Appl. Math. Comput..

[82]  Michael Florian,et al.  AN EFFICIENT IMPLEMENTATION OF THE NETWORK SIMPLEX METHOD. , 1997 .

[83]  Angelo Sifaleras,et al.  Some Computational Results on MPI Parallel Implementation of Dense Simplex Method , 2008 .

[84]  Devavrat Shah,et al.  Belief propagation for min-cost network flow: convergence & correctness , 2010, SODA '10.

[85]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[86]  Angelo Sifaleras,et al.  A DUAL EXTERIOR POINT SIMPLEX TYPE ALGORITHM FOR THE MINIMUM COST NETWORK FLOW PROBLEM , 2009 .

[87]  R. Musmanno,et al.  Efficient Parallel Algorithms for the Minimum Cost Flow Problem , 1997 .

[88]  Joel Sokol,et al.  A least-squares minimum-cost network flow algorithm , 2011, Ann. Oper. Res..

[89]  Jiuping Xu,et al.  A Nonlinear Multiobjective Bilevel Model for Minimum Cost Network Flow Problem in a Large-Scale Construction Project , 2012 .

[90]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

[91]  Panos M. Pardalos,et al.  Network Optimization , 1997 .

[92]  Angelo Sifaleras,et al.  Visualization software of the network exterior primal simplex algorithm for the minimum cost network flow problem , 2007, Oper. Res..

[93]  Michael C. Ferris,et al.  NEOS and Condor: solving optimization problems over the Internet , 2000, TOMS.

[94]  Esmaile Khorram,et al.  Preemptive priority-based algorithms for fuzzy minimal cost flow problem: An application in hazardous materials transportation , 2009, Comput. Ind. Eng..

[95]  Ravindra K. Ahuja,et al.  The Scaling Network Simplex Algorithm , 1992, Oper. Res..

[96]  László A. Végh.  Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives , 2011, STOC '12.

[97]  Angelo Sifaleras,et al.  Teaching Note - An Animated Demonstration of the Uncapacitated Network Simplex Algorithm , 2009, INFORMS Trans. Educ..

[98]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..