Capacitated multicommodity network flow problems with piecewise linear concave costs

IIE Transactions (Institute of Industrial Engineers)

Volumn 36, Issue 7, 2004, Pages 683-696

  Muriel, Ana ^a   Munshi, Farhad N ^a  

^a University of Massachusetts   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COST BENEFIT ANALYSIS; LINEAR PROGRAMMING; OPTIMIZATION; PIECEWISE LINEAR TECHNIQUES; PROBLEM SOLVING;

CAPACITATED MULTICOMMODITY NETWORK FLOW PROBLEMS; PIECEWISE LINEAR CONCAVE COSTS;

DECISION SUPPORT SYSTEMS;

EID: 2942644434     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1080/07408170490447357     Document Type: Article

References (21)

1. Ahuja, R., Magnanti, T. and Orlin, J.B. (1993) Network Flows: Theory, Algorithms and Applications, Prentice Hall. Englewood Cliffs, NJ.
2. Amiri, A. and Pirkul, H. (1997) New formulation and relaxation to solve a concave-cost network flow problem. Journal of the Operations Research Society, 48, 278-287.
3. Assad, A. (1978) Multicommodity network flows: a survey. Networks, 8, 37-92.
4. Balakrishnan, A. and Graves, S. (1989) A composite algorithm for a concave-cost network flow problem. Networks, 19, 175-202.
5. Balakrishnan, A., Magnanti, T.L., Shulman, A. and Wong, R.T. (1991) Models for planning capacity expansion in local access telecommunication networks. Annals of Operations Research, 33, 239-284.
6. Balakrishnan, A., Magnanti, T.L. and Wong, R.T. (1989) A dual-ascent procedure for large-scale uncapacitated network design. Annals of Operations Research, 37, 716-740.
7. Chan, A.L.M., Muriel, A. and Simchi-Levi, D. (2001) Uncapacitated production/distribution planning problems with piece-wise linear concave costs. Working paper, University of Massachusetts, Amherst, MA.
8. Crainic, T.G. and Gendron, B. (2001) Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete and Applied Mathematics, 112, 73-99.
9. Croxton, K., Gendron, B. and Magnanti, T. (2000) A comparison of mixed-integer programming models for non-convex piecewise linear cost minimization problems. Publication CRT-2000-31. Centre de Recherche sur les Transports, Université de Montréal, Montreal, Canada.
10. Croxton, K., Gendron, B. and Magnanti, T. (2003) Models and methods for merge-in-transit operations. Transportation Science, 37(1), 1-22.
11. Gavish, B. (1991) Topological design of telecommunication networks-local access design methods. Annals of Operations Research, 33, 17-71.
12. Gendron, B. and Crainic, T.C. (1994) Relaxations for multicommodity capacitated network design problems. Publication 965, Centre de Recherche sur les Transports, Université de Montréal, Montreal, Canada.
13. Gendron, B., Crainic, T. and Frangioni, A. (1999) Multicommodity capacitated network design, in Telecommunications Network Planning, Sans, B. and Soriano, P., (eds), pages 1-19, Kluwer, New York, NY.
14. Geoffrion, A.M. (1974) Lagrangean relaxation for integer programming. Mathematical Programming Study, 2, 82-114.
15. Guignard, M. and Kim, S. (1987) Lagrangean decomposition: a model yielding stronger bounds. Mathematical Programming Study, 39(2), 215-228.
16. Johnson, D.S., Lenstra, J.K. and Rinnooy Kan, A.H.G. (1978) The complexity of the network design problem. Networks, 8, 279-285
17. Kennington, J. (1978) A survey of linear multicommodity network flows. Operations Research, 26, 209-236.
18. Krarup, J. and Pruzan, P.M. (1983) The simple plant location problem: survey and synthesis. European Journal of Operational Research, 12(1), 36-81.
19. Magnanti, T.L. and Wong, R.T. (1984) Network design and transportation planning: models and algorithms. Transportation Science, 18, 1-55.
20. Minoux, M. (1989) Network synthesis and optimum network design problems: models, solution methods and applications. Networks, 19, 313-360.
21. Tomlin, J. (1966) Minimum cost multicommodity network flows. Operations Research, 14, 45-51.