, Network Flows : Theory, Algorithms and Applications, 1993.
New formulation and relaxation to solve a concave-cost network problem, J. Oper. Soc, vol.48, pp.278-287, 1997. ,
On splittable and unsplittable flow capacitated network design arc-set polyhedra, Mathematical Programming, vol.92, pp.315-333, 2002. ,
Design and operations of gas transmission networks, Operations Research, vol.60, pp.34-47, 2012. ,
A dual-ascent procedure for large-scale uncapacitated network design, Operations Research, vol.37, pp.716-740, 1989. ,
A composite algorithm for a concave-cost network flow problem, Networks, vol.19, pp.175-202, 1989. ,
Annotated Bibliographies in Combinatorial Optimization, Network Design, 1997. ,
The volume algorithm : producing primal solutions with subgradient method, Math. Programming A, vol.87, pp.385-399, 2000. ,
Network design using cut inequalities, SIAM J. on Optimization, vol.6, pp.823-837, 1996. ,
Note on Weintraub's minimum-cost circulation algorithm, SIAM J. on Computing, vol.18, pp.579-583, 1989. ,
Using Branch-and-Price-and-Cut to solve origin-destination integer multicommodity flow problems, Operations Research, vol.32, pp.208-220, 1998. ,
Compromising systems and user interests in shelter location, Transportation Research part B, vol.72, pp.146-163, 2015. ,
Minimum concave cost multicommodity network design, Telecommun. Sys, vol.36, pp.181-203, 2007. ,
Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints, vol.55, pp.171-180, 2010. ,
Solution methods for nonconvex network flow problems, Lecture N. Eco.Math. Sys. LNEMS, vol.450, pp.32-50, 1997. ,
, Programmation, Jeux et Réseaux de Transport, 1962.
Tabu search for a network loading problem with multiple facilities, Journal of Heuristics, 1999. ,
, Data Networks, 1992.
Computational Experience with a Difficult Mixed-Integer Multicommodity Flow Problem, Mathematical Programming 68, pp.213-237, 1995. ,
Capacitated network design-Polyhedral structure and computation, INFORMS J. of Computing, vol.8, pp.243-259, 1996. ,
Minimum Cost Capacity Installation for Multicommodity Network Flows, Mathematical Programming, vol.81, pp.177-199, 1998. ,
An MINLP solution method for a water network problem, Proc. ESA, vol.4168, pp.696-707, 2006. ,
Non-convex mixed-integer nonlinear programming : a survey, Survey in Oper. Res. and Man. Sci, vol.17, pp.97-106, 2012. ,
Nonconvex optimization for communications systems, Advances in Mechanics and Mathematics, Special Volume on Strang's 70th Birthday, 2007. ,
A survey on Benders decomposition applied to fixed-charge network design problems, Computers, vol.32, pp.1429-1450, 2005. ,
Benders, metric and cutset inequalities for multicommodity capacitated network design, Comp. Optimization and Appl, vol.42, pp.371-392, 2009. ,
Accelerating Benders decomposition with heuristic masterproblem solutions, Pesquisa Operacional, vol.32, pp.3-20, 2012. ,
Simplex-based Tabu search for the multicommodity capacitated fixed charge network design problem, INFORMS J. of Computing, vol.12, 2000. ,
Bundle-based relaxation method for multicommodity capacitated fixed charge network design, Discrete Applied Mathematics, vol.112, pp.77-99, 2001. ,
A comparison of mixed-integer programming models for non-Convex piecewise linear cost minimization problems, Management Sci, vol.49, pp.1268-1273, 2003. ,
Variable disaggregation in network flow problems with piecewise linear costs, Operations Research, vol.55, pp.146-157, 2007. ,
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
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. ,
Global optimization of capacity expansion and flow assignment for data networks, Pesquisa Operacional, vol.33, 2013. ,
, Practical Methods of Optimization, 1987.
A bundle-type dual ascent approach to linear multicommodity min cost flow problems, INFORMS J. on Computing, vol.11, pp.370-393, 1999. ,
0-1 reformulations of the multicommodity capacitated network design problem, Discrete Appl. Math, vol.157, pp.1229-1241, 2009. ,
The flow deviation method : an approach to store-and-forward communication network design, pp.97-133, 1973. ,
Combinatorial and continuous models for the optimization of traffic flow networks, SIAM J. on Optimization, vol.16, pp.1164-1176, 2006. ,
LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions, Acta Mathematica Vietnamica, vol.22, pp.128-145, 1997. ,
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
Multicommodity capacitated network design, pp.1-19, 1999. ,
On the topological design of distributed computer networks, IEEE Transactions on Communications, vol.25, pp.48-60, 1977. ,
Topology design and bandwith allocation in ATM nets, IEEE Journal on Selected Areas in Communications, vol.7, issue.8, pp.1253-1261, 1989. ,
Joint optimization of data network design and facility selection, IEEE Selected Areas in Communications, issue.8, pp.1667-1681, 1990. ,
Perspective reformulations of mixed-integer nonlinear programs with indicator variables, Mathematical Programming B, vol.124, pp.183-205, 2010. ,
A characteirzation of the uncapacitated network design polytope, Operations Research Letters, vol.12, pp.159-163, 1992. ,
Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem, INFORMS J. on Computing, vol.22, pp.314-325, 2010. ,
A Lagrangean Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem, Operations Research, vol.48, pp.461-481, 2000. ,
An Introduction to Global Optimization, Kluwer Academic ed, 1996. ,
Polynomial methods for separable convex optimization in unimodular spaces with applications, SIAM J. on Computing, vol.26, pp.1245-1275, 1997. ,
A capacity scaling heuristic for the multicommodity capacitated network design problem, J. of Comput. and Applied Math, vol.232, pp.90-101, 2009. ,
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. ,
Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems, vol.35, pp.216-222, 2000. ,
A primal method for minimal cost flows with applications to the assignment and transportation problems, Management Science, vol.14, pp.205-220, 1967. ,
Relax-and-cut for capacitated network design, Proc. ESA 2005, Lecture Computer Sci, vol.3369, pp.47-58, 2005. ,
Netspeak : an algebraic modelling language for nonconvex network optimization problems, Lecture N. Eco.Math. Sys. LNEMS, vol.450, pp.328-345, 1997. ,
DC programming approach for multicommodity network optimization problems with step-increasing cost functions, J. of Global Optim, vol.22, pp.205-232, 2002. ,
Bounds for global optimization of capacity expansion and flow assignment problems, Operations Research Letters, vol.26, pp.211-216, 2000. ,
, Network Design and Transportation Planning: Models and Algorithms, vol.18, pp.1-55, 1984.
Tailoring Benders Decomposition for Uncapacitated Network Design, Mathematical Programming Study, vol.26, pp.112-154, 1986. ,
The convex hull of two-core capacitated network design problems, Math. Programming, vol.60, pp.233-250, 1993. ,
Modeling and solving the two-facility capacitated network loading, Operations Research, vol.43, pp.142-157, 1995. ,
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
, 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
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
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
Mixed-integer models for the stationary case of gas network optimization, Mathematical Programming 105, pp.563-582, 2006. ,
Multiflots de coût minimal avec fonctions de coût concaves, Annales des Télécommunications, vol.31, pp.77-92, 1976. ,
Solving integer minimum-cost flow problems with separable convex cost objectives polynomially, Mathematical Programming Study, vol.26, pp.237-249, 1986. ,
Network synthesis and optimum network design problems: models, solution methods and applications, vol.19, pp.313-360, 1989. ,
Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks, Europ. J. Oper. Res, vol.232, pp.618-629, 2014. ,
Capacitated multicommodity network flow problems with piecewise linear concave costs, pp.683-696, 2004. ,
A local relaxation approach for the siting of electrical substations, Comput. Optim. and Appl, vol.33, pp.7-49, 2006. ,
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 survey of algorithms for convex multicommodity flow problems, Management Science, vol.46, pp.126-147, 2000. ,
URL : https://hal.archives-ouvertes.fr/hal-01729109
The congested multicommodity network design problem, pp.166-187, 2016. ,
Methods for global optimization : a bibliographic survey, SIAM Review, vol.28, pp.367-379, 1986. ,
Open questions in complexity theory for numerical optimization, Math. programming, vol.57, pp.337-339, 1992. ,
, GRASP with path-relinking for private virtual circuit routing, Networks, vol.41, pp.104-114, 2003.
Network Flows and Monotropic Programming, 1984. ,
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
Multimodal freight transportation planning : a literature review, European J. Oper. Research, vol.233, pp.1-15, 2014. ,
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
A concave link elimination procedure and lower bound for concave topology, capacity and flow assignment network design problems, vol.13, pp.351-372, 2000. ,
A polyhedral approach to multicommodity survivable network design, Numerische Math, vol.68, pp.149-167, 1994. ,
, , 1997.
Concave programming under linear constraints, Soviet Math, vol.5, pp.1437-1440, 1964. ,
Minimum aggregate concave cost multicommodity flows in strong seriesparallel networks, Math. Oper. Research, vol.24, pp.106-129, 1999. ,
A primal algorithm to solve network flow problems with convex costs, Management Science, vol.21, pp.87-97, 1974. ,
Simultaneous routing and resource allocation via dual decomposition, IEEE Trans. on Communications, vol.52, pp.1136-1144, 2004. ,
Minimum-cost routing for static network models, pp.139-172, 1971. ,
Minimum concave cost network flows in certain networks, Management Sci, vol.14, pp.429-450, 1968. ,