Affine routing for robust network design

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Stochastic programming (90C15) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Cites Work

Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
A comparison of routing sets for robust network design
Generalized decision rule approximations for stochastic programming via liftings
Primal and dual linear decision rules in stochastic and robust optimization
On the power and limitations of affine policies in two-stage adaptive optimization
Routing of uncertain traffic demands
On improving optimal oblivious routing
Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
0-1 reformulations of the multicommodity capacitated network design problem
Robust discrete optimization and network flows
Adjustable robust solutions of uncertain linear programs
Multipolar robust optimization
A survey of adjustable robust optimization
A survey on Benders decomposition applied to fixed-charge network design problems
Decomposition for adjustable robust linear optimization subject to uncertainty polytope
On the approximability of robust network design
The robust network loading problem with dynamic routing
Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set
On cut-based inequalities for capacitated network design polyhedra
Robust routing and optimal partitioning of a traffic demand polytope
Optimality of Affine Policies in Multistage Robust Optimization
A Geometric Characterization of the Power of Finite Adaptability in Multistage Stochastic and Adaptive Optimization
Robust Metric Inequalities for Network Loading Under Demand Uncertainty
Hardness of robust network design
Designing Least-Cost Nonblocking Broadband Networks
Solving the bifurcated and nonbifurcated robust network loading problem with k‐adaptive routing
Provisioning a virtual private network
Affine recourse for the robust network design problem: Between static and dynamic routing
Optimal oblivious routing in polynomial time
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item