Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Discrete intermodal freight transportation network design with route choice behavior of intermodal operators
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 …
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
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 …
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
Data center networks provide the physical infrastructure that hosts Internet‐related services
and cloud computing. Designing data center networks properly is imperative for Internet …
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 …
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
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 …
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
We address a class of particularly hard-to-solve combinatorial optimization problems,
namely that of multicommodity network optimization when the link cost functions are …
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 …
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 …
applying optimization models in the telecommunications sector. The Brazilian information …
[HTML][HTML] Tree network design avoiding congestion
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 …
We see this problem arising in telecommunication and transportation networks as a flow …
Multicommodity network flows with nonconvex arc costs
We present a survey on nonconvex models and algorithms for multicommodity network
design problems. We put in perspective the alternative modelling of these problems …
design problems. We put in perspective the alternative modelling of these problems …