Discrete intermodal freight transportation network design with route choice behavior of intermodal operators

X Wang, Q Meng - Transportation Research Part B: Methodological, 2017 - Elsevier
We consider a discrete intermodal network design problem for freight transportation, in
which the network planner needs to determine whether or not to build up or expand a link to …

Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios

M Garg, JC Smith - Omega, 2008 - Elsevier
We consider the design of a multicommodity flow network, in which point-to-point demands
are routed across the network subject to link capacity restrictions. Such a design must build …

Data Center Network Design for Internet‐Related Services and Cloud Computing

Y Liang, M Lu, ZJM Shen… - Production and …, 2021 - journals.sagepub.com
Data center networks provide the physical infrastructure that hosts Internet‐related services
and cloud computing. Designing data center networks properly is imperative for Internet …

Capacity and flow assignment of data networks by generalized Benders decomposition

P Mahey, A Benchakroun, F Boyer - Journal of Global Optimization, 2001 - Springer
A mixed-integer non-linear model is proposed to optimize jointly the assignment of
capacities and flows (the CFA problem) in a communication network. Discrete capacities are …

Local optimality conditions for multicommodity flow problems with separable piecewise convex costs

P Mahey, MC de Souza - Operations Research Letters, 2007 - Elsevier
We consider here a multicommodity flow network optimization problem with non-convex but
piecewise convex arc cost functions. We derive complete optimality conditions for local …

DC programming approach for multicommodity network optimization problems with step increasing cost functions

LT Hoai An, PD Tao - Journal of Global Optimization, 2002 - Springer
We address a class of particularly hard-to-solve combinatorial optimization problems,
namely that of multicommodity network optimization when the link cost functions are …

A conic quadratic formulation for a class of convex congestion functions in network flow problems

S Gürel - European Journal of Operational Research, 2011 - Elsevier
In this paper we consider a multicommodity network flow problem with flow routing and
discrete capacity expansion decisions. The problem involves trading off congestion and …

Network planning problems in telecommunications

HPL Luna - Handbook of optimization in telecommunications, 2006 - Springer
This chapter describes the main results of two decades of experience in studying and
applying optimization models in the telecommunications sector. The Brazilian information …

[HTML][HTML] Tree network design avoiding congestion

G Miranda, HP Luna, RS De Camargo… - Applied mathematical …, 2011 - Elsevier
We introduce in this paper an optimal method for tree network design avoiding congestion.
We see this problem arising in telecommunication and transportation networks as a flow …

Multicommodity network flows with nonconvex arc costs

P Mahey, MC Souza - Pesquisa Operacional, 2017 - SciELO Brasil
We present a survey on nonconvex models and algorithms for multicommodity network
design problems. We put in perspective the alternative modelling of these problems …