A computational study of cost reoptimization for min-cost flow problems

INFORMS Journal on Computing

Volumn 18, Issue 1, 2006, Pages 61-70

  Frangioni, Antonio ^a   Manca, Antonio ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF CAGLIARI   (Italy)

Author keywords

Analysis of algorithms; Computers computer science: Software; Networks graphs: Flow algorithms; Networks graphs: Multicommodity

Indexed keywords

EID: 33645578193     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0081     Document Type: Review

References (18)

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