Solving the undirected multicommodity flow problem using a shortest path-based pricing algorithm

Networks

Volumn 38, Issue 4, 2001, Pages 181-188

  McBride, Richard D ^a   Mamer, John W ^b  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Linear programming; Multicommodity flows; Optimization; Simplex method

Indexed keywords

EID: 0035648007     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.1035     Document Type: Article

References (14)

1. [1] R. Ahuja, T. Magnanti, and J. Orlin, Network flows, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. [2] C. Barnhart, E. Johnson, C. Hane, and G. Sigismondi, An alternative formulation and solution strategy for multicommodity network flow problems, Telecommun Syst 3 (1993), 239-258.
3. [3] C. Hane, Private communication, 1996.
4. [4] R. Fourer, A simplex algorithm for piecewise-linear programming. I: Derivation and proof, Math Program 33 (1985), 281-315.
5. [5] R. Fourer, A simplex algorithm for piecewise-linear programming. II: Derivation and proof, Math Program 41 (1988), 204-233.
6. [6] J. Mamer and R. McBride, A decomposition based pricing procedure for large scale linear programs: An application to the linear multicommodity flow problem, Mgmt Sci May 46 (2000) 693-709.
7. [7] R. McBride, Solving embedded generalized network problems, Eur J Oper Res 21 (1985), 82-92.
8. [8] R. McBride, Advances in solving the multicommodity flow problem, Interfaces 2 (1988), 32-41.
9. [9] R. McBride, Progress made in solving the multicommodity flow problem, SIAM J Optim 8 (1988), 947-955.
10. [10] R. McBride and J. Mamer, Solving multicommodity flow problems, manuscript, 1996.
11. [11] R. McBride and J. Mamer, Solving multicommodity flow problems with a primal embedded network simplex algorithm, INFORMS J Comput 9 (1997), 154-163.
12. [12] R. McBride and J. Mamer, Solving multicommodity flow problems, manuscript, 2000.
13. [13] R. Murthy and R. Helgason, A direct simplex algorithm for network flow problems with piecewise linear costs, Department of Computer Science and Engineering, Southern Methodist University, 1993.
14. [14] A. Premoli, Piecewise-linear programming: The compact (CPLP) algorithm, Math Program 36 (1986), 210-227.