Exact solution of multicommodity network optimization problems with general step cost functions

Operations Research Letters

Volumn 25, Issue 1, 1999, Pages 15-23

  Gabrel, V ^a   Knippel, A ^b   Minoux, M ^b  

^a UNIVERSITÉ PARIS 13   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; CONSTRAINT THEORY; INTEGER PROGRAMMING; ITERATIVE METHODS; MATHEMATICAL MODELS;

BENDERS METHOD; MULTICOMMODITY FLOWS; MULTIPLE CONSTRAINT GENERATION; OPTIMUM NETWORK DESIGN;

LINEAR PROGRAMMING;

EID: 0032687473     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(99)00020-6     Document Type: Article

References (19)

1. R.K. Ahuja, T. Magnanti, J. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. Avis D. On the extreme rays of the metric cone. Can. J. Math. 32:1980;126-144.
3. Barahona F. Network design using cut inequalities. SIAM J. Optim. 6(3):1996;823-837.
4. Benders J.F. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik. 4:1962;238-252.
5. Cheng C.K., Hu T.C. Ancestor tree for arbitrary multiterminal cut functions. Ann. Oper. Res. 33:1991;199-213.
6. Gabrel V., Minoux M. LP relaxations better than convexification for multicommodity network optimization problems with step-increasing cost functions. Acta Mathematica Vietnamica. 22:1997;128-145.
7. Gomory R.E., Hu T.C. An application of generalized linear programming to network flows. SIAM J. Appl. Math. 10(2):1962;260-283.
8. M. Gondran, M. Minoux, Graphes et Algorithmes, third ed., Paris, Eyrolles, 1995.
9. M. Grötschel, C.L. Monma, M. Stoer, Design of survivable networks, in: Handbook in OR and MS, North-Holland, vol. 7, 1995, pp. 617-672.
10. Hoang H.H. Topological optimization of networks: a nonlinear mixed integer model employing generalized Benders decomposition. IEEE Trans. Automat. Control. AC-27:1982;164-169.
11. Kennington J.L. A survey of linear cost multicommodity network flows. Oper. Res. 26:1978;209-236.
12. Kernighan B.W., Lin S. An efficient heuristic procedure for partitioning graphs. Bell. Systems Tech. J. 49(2):1970;291-307.
13. Magnanti T.L., Mirchandani P. Shortest paths, single origin-destination network design and associated polyhedra. Networks. 23:1993;103-121.
14. Magnanti T.L., Mirchandani P., Vachani R. Modeling and solving the two-facility network loading problem. Oper. Res. 43(1):1995;142-157.
15. Magnanti T.L., Mireault P., Wong R.T. Tailoring Benders decomposition for uncapacitated network design. Math. Programming Study. 26:1986;112-154.
16. Minoux M. Optimum synthesis of a network with nonsimultaneous multicommodity flow requirements. Ann. Discrete Math. 11:1981;269-277.
17. M. Minoux, Subgradient optimization and Benders decomposition for large scale programming, in: R.W. Cottle, M.L. Kelmanson, B. Korte (Eds.), Mathematical Programming, North-Holland, Amsterdam, 1984, pp. 271-288.
18. Minoux M. Network synthesis and optimum network design problems: models, solution methods and applications. Networks. 19:1989;313-360.
19. Stoer M., Dahl G. A polyhedral approach to multicommodity survivable network design. Numerische Mathematik. 68:1994;149-167.