A Computational Study of Cost Reoptimization for Min-Cost Flow Problems

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice-Hall, Inc., Englewood Cliffs, NJ) Google Scholar
• Amini M. M., Barr R. S. Network reoptimization algorithms: A statistically designed comparison. ORSA J. Comput. (1993) 5:395–409Link, Google Scholar
• Bertsekas D. P.Linear Network Optimization: Algorithms and Codes (1991) (MIT Press, Cambridge, MA) Google Scholar
• Bertsekas D. P.Network Optimization: Continuous and Discrete Models (1998) (Athena Scientific, Belmont, MA) Google Scholar
• Bertsekas D. P., Eckstein J. Dual coordinate step methods for linear network flow problems. Math. Programming (1988) 42:203–243Crossref, Google Scholar
• Bertsekas D. P., Tseng P. Relaxation methods for minimum cost ordinary and generalized network flow problems. Oper. Res. (1988a) 36:93–114Link, Google Scholar
• Bertsekas D. P., Tseng P. RELAX: A computer code for minimum cost network flow problems. Ann. Oper. Res. (1988b) 13:127–190Crossref, Google Scholar
• Bertsekas D. P., Tseng P. RELAX-IV: A faster version of the RELAX code for solving minimum cost flow problems. (1994) . Technical report LIDS-P-2276, Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Castro J., Nabona N. An implementation of linear and nonlinear multicommodity network flows. Eur. J. Oper. Res. (1996) 92:37–53Crossref, Google Scholar
• CPLEX, Inc. Using the CPLEX callable library. (2002) (Incline Village, NV)Google Scholar
• Frangioni A., Gallo G. A bundle type dual-ascent approach to linear multicommodity min cost flow problems. INFORMS J. Comput. (1999) 11:370–393Link, Google Scholar
• Gendron B., Crainic T. G., Frangioni A. Bundle-based relaxation methods for multicommodity capacitated fixed charge network design problems. Discrete Appl. Math. (2001) 112:73–99Crossref, Google Scholar
• Goldberg A. V. An efficient implementation of a scaling minimum-cost flow algorithm. J. Algorithms (1997) 22:1–29Crossref, Google Scholar
• Goldberg A. V., Tarjan R. Finding minimum cost circulation by successive approximation. Math. Oper. Res. (1990) 15:430–466Link, Google Scholar
• Helgason R. V., Kennington J. L., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Primal simplex algorithms for minimum cost network. Handbooks in Operations Research and Management Science (1995) 7(North-Holland, Amsterdam, The Netherlands) 85–113Google Scholar
• Löbel A. Solving large-scale real-world minimum-cost flow problems by a network simplex method. (1996) . Technical report SC 96-7, Konrad-Zuse-Zentrum für Informationstechnik, Berlin, GermanyGoogle Scholar
• Löbel A. Vehicle scheduling in public transit and lagrangean pricing. Management Sci. (1999) 44:1637–1649Link, Google Scholar
• Resende M. G. C., Pardalos P. M., Beasley J. E. Interior point algorithms for network flow problems. Advances in Linear and Integer Programming (1996) (Oxford University Press, Oxford, UK) 147–187Crossref, Google Scholar