R. V. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows : Theory, Algorithms and Applications, 1993.

A. Amiri and H. Pirkul, New formulation and relaxation to solve a concave-cost network problem, J. Oper. Soc, vol.48, pp.278-287, 1997.

A. Atamtürk and D. Rajan, On splittable and unsplittable flow capacitated network design arc-set polyhedra, Mathematical Programming, vol.92, pp.315-333, 2002.

F. Babonneau, Y. Nesterov, and J. P. Vial, Design and operations of gas transmission networks, Operations Research, vol.60, pp.34-47, 2012.

A. Balakrishnan, T. L. Magnanti, and W. , A dual-ascent procedure for large-scale uncapacitated network design, Operations Research, vol.37, pp.716-740, 1989.

A. Balakrishnan and C. S. Graves, A composite algorithm for a concave-cost network flow problem, Networks, vol.19, pp.175-202, 1989.

A. Balakrishnan, T. L. Magnanti, and P. Mirchandani, Annotated Bibliographies in Combinatorial Optimization, Network Design, 1997.

F. Barahona and R. Anbil, The volume algorithm : producing primal solutions with subgradient method, Math. Programming A, vol.87, pp.385-399, 2000.

F. Barahona, Network design using cut inequalities, SIAM J. on Optimization, vol.6, pp.823-837, 1996.

F. Barahona and E. Tardos, Note on Weintraub's minimum-cost circulation algorithm, SIAM J. on Computing, vol.18, pp.579-583, 1989.

C. Barnhart, Using Branch-and-Price-and-Cut to solve origin-destination integer multicommodity flow problems, Operations Research, vol.32, pp.208-220, 1998.

V. Bayram, B. C. Tansel, and H. Yaman, Compromising systems and user interests in shelter location, Transportation Research part B, vol.72, pp.146-163, 2015.

C. F. Bazlamaçci and F. Say, Minimum concave cost multicommodity network design, Telecommun. Sys, vol.36, pp.181-203, 2007.

T. Bektas, M. Chouman, and T. G. Crainic, Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints, vol.55, pp.171-180, 2010.

G. J. Bell and B. W. Lamar, Solution methods for nonconvex network flow problems, Lecture N. Eco.Math. Sys. LNEMS, vol.450, pp.32-50, 1997.

C. Berge and A. Ghouila-houri, Programmation, Jeux et Réseaux de Transport, 1962.

D. Berger, B. Gendron, J. Y. Potvin, S. Raghavan, and P. Soriano, Tabu search for a network loading problem with multiple facilities, Journal of Heuristics, 1999.

D. P. Bertsekas and R. G. Gallager, Data Networks, 1992.

D. Bienstock and O. Günlük, Computational Experience with a Difficult Mixed-Integer Multicommodity Flow Problem, Mathematical Programming 68, pp.213-237, 1995.

D. Bienstock and O. Günlük, Capacitated network design-Polyhedral structure and computation, INFORMS J. of Computing, vol.8, pp.243-259, 1996.

D. Bienstock, S. Chopra, O. Günlük, and C. Tsai, Minimum Cost Capacity Installation for Multicommodity Network Flows, Mathematical Programming, vol.81, pp.177-199, 1998.

C. Bragalli, C. Ambrosio, J. Lee, A. Lodi, and P. Toth, An MINLP solution method for a water network problem, Proc. ESA, vol.4168, pp.696-707, 2006.

S. Burer and A. N. Letchford, Non-convex mixed-integer nonlinear programming : a survey, Survey in Oper. Res. and Man. Sci, vol.17, pp.97-106, 2012.

M. Chiang-;-d, H. Gao, and . Sherali, Nonconvex optimization for communications systems, Advances in Mechanics and Mathematics, Special Volume on Strang's 70th Birthday, 2007.

A. M. Costa, A survey on Benders decomposition applied to fixed-charge network design problems, Computers, vol.32, pp.1429-1450, 2005.

A. M. Costa, J. F. Cordeau, and B. Gendron, Benders, metric and cutset inequalities for multicommodity capacitated network design, Comp. Optimization and Appl, vol.42, pp.371-392, 2009.

A. M. Costa, J. F. Cordeau, B. Gendron, and B. Laporte, Accelerating Benders decomposition with heuristic masterproblem solutions, Pesquisa Operacional, vol.32, pp.3-20, 2012.

T. G. Crainic, M. Gendreau, and J. Farvolden, Simplex-based Tabu search for the multicommodity capacitated fixed charge network design problem, INFORMS J. of Computing, vol.12, 2000.

T. G. Crainic, A. Frangioni, and B. Gendron, Bundle-based relaxation method for multicommodity capacitated fixed charge network design, Discrete Applied Mathematics, vol.112, pp.77-99, 2001.

K. L. Croxton, B. Gendron, and T. L. Magnanti, A comparison of mixed-integer programming models for non-Convex piecewise linear cost minimization problems, Management Sci, vol.49, pp.1268-1273, 2003.

K. L. Croxton, B. Gendron, and T. L. Magnanti, Variable disaggregation in network flow problems with piecewise linear costs, Operations Research, vol.55, pp.146-157, 2007.

C. Ambrosio, J. Lee, and A. Wächter, An algorithmic framework for MINLP with separable non-convexity, Mixed-Integer Nonlinear Programming, vol.154, pp.315-348, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00758046

A. Fakhri and M. Ghatee, Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion, Applied Math. Modelling, vol.40, pp.6488-6476, 2016.

R. P. Ferreira, H. P. Luna, P. Mahey, and M. C. Souza, Global optimization of capacity expansion and flow assignment for data networks, Pesquisa Operacional, vol.33, 2013.

R. Fletcher, Practical Methods of Optimization, 1987.

A. Frangioni and G. Gallo, A bundle-type dual ascent approach to linear multicommodity min cost flow problems, INFORMS J. on Computing, vol.11, pp.370-393, 1999.

A. Frangioni and B. Gendron, 0-1 reformulations of the multicommodity capacitated network design problem, Discrete Appl. Math, vol.157, pp.1229-1241, 2009.

L. Fratta, M. Gerla, and L. Kleinrock, The flow deviation method : an approach to store-and-forward communication network design, pp.97-133, 1973.

A. Fügenschuh, M. Herty, A. Klar, and A. Martin, Combinatorial and continuous models for the optimization of traffic flow networks, SIAM J. on Optimization, vol.16, pp.1164-1176, 2006.

V. Gabrel and M. Minoux, LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions, Acta Mathematica Vietnamica, vol.22, pp.128-145, 1997.

V. Gabrel, A. Knippel, and M. Minoux, Exact Solution of Multicommodity Network Optimization Problems with General Step Cost Functions, Operations Research Letters, vol.25, pp.15-23, 1999.
URL : https://hal.archives-ouvertes.fr/hal-01150534

B. Gendron, T. G. Crainic, and A. Frangioni, Multicommodity capacitated network design, pp.1-19, 1999.

M. Gerla and L. Kleinrock, On the topological design of distributed computer networks, IEEE Transactions on Communications, vol.25, pp.48-60, 1977.

M. Gerla, J. A. Monteiro, and R. Pazos, Topology design and bandwith allocation in ATM nets, IEEE Journal on Selected Areas in Communications, vol.7, issue.8, pp.1253-1261, 1989.

A. Gersht and R. Weihmayer, Joint optimization of data network design and facility selection, IEEE Selected Areas in Communications, issue.8, pp.1667-1681, 1990.

O. Günlük and J. Linderoth, Perspective reformulations of mixed-integer nonlinear programs with indicator variables, Mathematical Programming B, vol.124, pp.183-205, 2010.

J. Hellstrand, T. Larsson, and A. Migdalas, A characteirzation of the uncapacitated network design polytope, Operations Research Letters, vol.12, pp.159-163, 1992.

M. Hewitt, G. L. Nemhauser, and M. W. Savelsbergh, Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem, INFORMS J. on Computing, vol.22, pp.314-325, 2010.

K. Holmberg and D. Yuan, A Lagrangean Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem, Operations Research, vol.48, pp.461-481, 2000.

R. Horst, P. M. Pardalos, and N. V. Thoai, An Introduction to Global Optimization, Kluwer Academic ed, 1996.

A. Karzanov and S. T. Mc-cormick, Polynomial methods for separable convex optimization in unimodular spaces with applications, SIAM J. on Computing, vol.26, pp.1245-1275, 1997.

N. Katayama, M. Chen, and M. Kubo, A capacity scaling heuristic for the multicommodity capacitated network design problem, J. of Comput. and Applied Math, vol.232, pp.90-101, 2009.

D. Kim and P. M. Pardalos, A solution approach to the fixed charged network flow problem using a dynamic slope scaling procedure, Operations Research Letters, vol.24, pp.192-203, 1999.

D. Kim and P. M. Pardalos, Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems, vol.35, pp.216-222, 2000.

M. Klein, A primal method for minimal cost flows with applications to the assignment and transportation problems, Management Science, vol.14, pp.205-220, 1967.

G. Kliever and L. Timajev, Relax-and-cut for capacitated network design, Proc. ESA 2005, Lecture Computer Sci, vol.3369, pp.47-58, 2005.

B. W. Lamar and C. A. Wallace, Netspeak : an algebraic modelling language for nonconvex network optimization problems, Lecture N. Eco.Math. Sys. LNEMS, vol.450, pp.328-345, 1997.

H. A. Lethi and D. T. Pham, DC programming approach for multicommodity network optimization problems with step-increasing cost functions, J. of Global Optim, vol.22, pp.205-232, 2002.

H. P. Luna and P. Mahey, Bounds for global optimization of capacity expansion and flow assignment problems, Operations Research Letters, vol.26, pp.211-216, 2000.

T. L. Magnanti and R. T. Wong, Network Design and Transportation Planning: Models and Algorithms, vol.18, pp.1-55, 1984.

T. L. Magnanti, P. Mireault, and R. T. Wong, Tailoring Benders Decomposition for Uncapacitated Network Design, Mathematical Programming Study, vol.26, pp.112-154, 1986.

T. L. Magnanti, P. Mirchandani, and R. Vachani, The convex hull of two-core capacitated network design problems, Math. Programming, vol.60, pp.233-250, 1993.

T. L. Magnanti, P. Mirchandani, and R. Vachani, Modeling and solving the two-facility capacitated network loading, Operations Research, vol.43, pp.142-157, 1995.

P. Mahey, A. Benchakroun, and F. Boyer, Capacity and flow assignment of data networks by generalized Benders decomposition, J. of Global Optimization, vol.20, pp.173-193, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00125817

P. Mahey, A. Ouorou, L. Leblanc, and J. Chifflet, A new proximal decomposition algorithm for routing in telecommunication networks, Networks, vol.31, pp.227-238, 1998.
URL : https://hal.archives-ouvertes.fr/hal-02090308

P. Mahey and M. C. Souza, Local optimality conditions for multicommodity flow problems with separable piecewise convex costs, Operations Research Letters, vol.35, pp.221-226, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00125824

P. Mahey, Q. P. Thai, and M. C. Souza, Separable convexification and DCA techniques for capacity and flow assignment, RAIRO Oper. Res, vol.35, pp.269-281, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00125822

A. Martin, M. Möller, and S. Moritz, Mixed-integer models for the stationary case of gas network optimization, Mathematical Programming 105, pp.563-582, 2006.

M. Minoux, Multiflots de coût minimal avec fonctions de coût concaves, Annales des Télécommunications, vol.31, pp.77-92, 1976.

M. Minoux, Solving integer minimum-cost flow problems with separable convex cost objectives polynomially, Mathematical Programming Study, vol.26, pp.237-249, 1986.

M. Minoux, Network synthesis and optimum network design problems: models, solution methods and applications, vol.19, pp.313-360, 1989.

R. Morabito, M. C. Souza, and M. Vazquez, Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks, Europ. J. Oper. Res, vol.232, pp.618-629, 2014.

A. Muriel and F. Munsh, Capacitated multicommodity network flow problems with piecewise linear concave costs, pp.683-696, 2004.

W. Murray and U. Shahnbag, A local relaxation approach for the siting of electrical substations, Comput. Optim. and Appl, vol.33, pp.7-49, 2006.

A. Ouorou and P. Mahey, A minimum-mean cycle cancelling method for multicommodity flow problems, European J. of Operations Research, vol.121, pp.532-548, 2000.
URL : https://hal.archives-ouvertes.fr/hal-01644719

A. Ouorou, P. Mahey, and J. P. Vial, A survey of algorithms for convex multicommodity flow problems, Management Science, vol.46, pp.126-147, 2000.
URL : https://hal.archives-ouvertes.fr/hal-01729109

D. C. Paraskevopoulos, S. Gürel, and T. Bektas, The congested multicommodity network design problem, pp.166-187, 2016.

P. M. Pardalos and J. B. Rosen, Methods for global optimization : a bibliographic survey, SIAM Review, vol.28, pp.367-379, 1986.

P. M. Pardalos and S. Vavasis, Open questions in complexity theory for numerical optimization, Math. programming, vol.57, pp.337-339, 1992.

M. G. Resende and C. C. Ribeiro, GRASP with path-relinking for private virtual circuit routing, Networks, vol.41, pp.104-114, 2003.

R. T. Rockafellar, Network Flows and Monotropic Programming, 1984.

G. K. Saharidis, M. Minoux, and M. G. Ierapetritou, Accelerating Benders method using covering cut bundle generation, Int. Trans. Oper. Res, vol.17, pp.221-237, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01170363

M. S. Seifi, N. P. Dellaert, W. Nuijten, T. Van-woensel, and R. Raoufi, Multimodal freight transportation planning : a literature review, European J. Oper. Research, vol.233, pp.1-15, 2014.

M. C. Souza, P. Mahey, and B. Gendron, Cycle-based algorithms for multicommodity network flow problems with piecewise convex costs, vol.51, pp.133-141, 2008.
URL : https://hal.archives-ouvertes.fr/hal-02090305

C. H. Stacey, T. Eyers, and G. J. Anido, A concave link elimination procedure and lower bound for concave topology, capacity and flow assignment network design problems, vol.13, pp.351-372, 2000.

M. Stoer and G. Dahl, A polyhedral approach to multicommodity survivable network design, Numerische Math, vol.68, pp.149-167, 1994.

E. Tardos, , 1997.

H. Tuy, Concave programming under linear constraints, Soviet Math, vol.5, pp.1437-1440, 1964.

J. Ward, Minimum aggregate concave cost multicommodity flows in strong seriesparallel networks, Math. Oper. Research, vol.24, pp.106-129, 1999.

A. Weintraub, A primal algorithm to solve network flow problems with convex costs, Management Science, vol.21, pp.87-97, 1974.

L. Xiao, M. Johansson, and S. P. Boyd, Simultaneous routing and resource allocation via dual decomposition, IEEE Trans. on Communications, vol.52, pp.1136-1144, 2004.

B. A. Yaged, Minimum-cost routing for static network models, pp.139-172, 1971.

W. I. Zangwill, Minimum concave cost network flows in certain networks, Management Sci, vol.14, pp.429-450, 1968.