Affine recourse for the robust network design problem: Between static and dynamic routing
From MaRDI portal
Publication:5326787
DOI10.1002/net.21482zbMath1269.90025OpenAlexW2088009718MaRDI QIDQ5326787
Publication date: 6 August 2013
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21482
robust optimizationnetwork designrecourseaffine routingaffine adjustable robust counterpartsdemand polytope
Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)
Related Items (20)
Robust Network Design with Uncertain Outsourcing Cost ⋮ Network design in scarce data environment using moment-based distributionally robust optimization ⋮ An iterative security game for computing robust and adaptive network flows ⋮ Generalized hose uncertainty in single-commodity robust network design ⋮ Robust minimum cost flow problem under consistent flow constraints ⋮ Affine routing for robust network design ⋮ An efficient approach to optimization of semi‐stable routing in multicommodity flow networks ⋮ Minimizing recovery cost of network optimization problems ⋮ A comparison of routing sets for robust network design ⋮ Multipolar robust optimization ⋮ \(k\)-adaptive routing for the robust network loading problem ⋮ A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation ⋮ A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides ⋮ On the approximability of robust network design ⋮ Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity ⋮ Decomposition for adjustable robust linear optimization subject to uncertainty polytope ⋮ A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study ⋮ Designing networks with resiliency to edge failures using two-stage robust optimization ⋮ A distributed method for optimal capacity reservation ⋮ Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios
Uses Software
Cites Work
- Unnamed Item
- Static and dynamic routing under disjoint dominant extreme demands
- Dynamic vs. oblivious routing in network design
- On the power and limitations of affine policies in two-stage adaptive optimization
- Routing of uncertain traffic demands
- On improving optimal oblivious routing
- 0-1 reformulations of the multicommodity capacitated network design problem
- Partitioning procedures for solving mixed-variables programming problems
- Robust solutions of uncertain linear programs
- Robust discrete optimization and network flows
- Adjustable robust solutions of uncertain linear programs
- Robust solutions of linear programming problems contaminated with uncertain data
- A survey on Benders decomposition applied to fixed-charge network design problems
- On capacitated network design cut-set polyhedra
- Robust optimization-methodology and applications
- The robust network loading problem with dynamic routing
- Robust capacity assignment solutions for telecommunications networks with uncertain demands
- The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
- A Hybrid Polyhedral Uncertainty Model for the Robust Network Loading Problem
- On cut-based inequalities for capacitated network design polyhedra
- Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
- Provisioning virtual private networks under traffic uncertainty
- Virtual Private Network Design Under Traffic Uncertainty
- Hardness of robust network design
- The Price of Robustness
- Provisioning a virtual private network
- Robust capacity expansion of network flows
- Robust solutions for network design under transportation cost and demand uncertainty
- Domination Between Traffic Matrices
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Capacitated Network Design—Polyhedral Structure and Computation
This page was built for publication: Affine recourse for the robust network design problem: Between static and dynamic routing
