The robust network loading problem with dynamic routing
From MaRDI portal
Publication:2377165
DOI10.1007/s10589-012-9500-0zbMath1271.90099OpenAlexW1996680903MaRDI QIDQ2377165
Publication date: 28 June 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://eprints.bice.rm.cnr.it/1439/1/TR_3_2010.pdf
Related Items
Single-commodity robust network design with finite and hose demand sets ⋮ Single-commodity robust network design problem: complexity, instances and heuristic solutions ⋮ Robust Metric Inequalities for Network Loading Under Demand Uncertainty ⋮ Robust Network Design with Uncertain Outsourcing Cost ⋮ Network design in scarce data environment using moment-based distributionally robust optimization ⋮ Robust Shift Scheduling in Call Centers ⋮ Robust network design: Formulations, valid inequalities, and computations ⋮ Affine recourse for the robust network design problem: Between static and dynamic routing ⋮ 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 ⋮ 2-stage robust MILP with continuous recourse variables ⋮ \(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 ⋮ On the approximability of robust network design ⋮ Experiments on virtual private network design with concave capacity costs ⋮ Decomposition for adjustable robust linear optimization subject to uncertainty polytope ⋮ A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study ⋮ Benders Decomposition for Capacitated Network Design
Uses Software
Cites Work
- Unnamed Item
- Solving survivable two-layer network design problems by metric inequalities
- Dynamic vs. oblivious routing in network design
- The convex hull of two core capacitated network design problems
- Bilevel programming: a survey
- Routing of uncertain traffic demands
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Minimum cost capacity installation for multicommodity network flows
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- Robust discrete optimization and network flows
- Separating tight metric inequalities by bilevel programming
- Metric inequalities and the network loading problem
- The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
- On cut-based inequalities for capacitated network design polyhedra
- Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- Provisioning virtual private networks under traffic uncertainty
- Hardness of robust network design
- Designing Least-Cost Nonblocking Broadband Networks
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Network Design Using Cut Inequalities
- Provisioning a virtual private network
- Robust network design: Formulations, valid inequalities, and computations
- Domination Between Traffic Matrices
- k-Partition-based facets of the network design problem
- Geometry of cuts and metrics
