The robust network loading problem with dynamic routing
From MaRDI portal
Recommendations
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty
- Solving the bifurcated and nonbifurcated robust network loading problem with \(k\)-adaptive routing
- Static and dynamic routing under disjoint dominant extreme demands
Cites work
- scientific article; zbMATH DE number 3354799 (Why is no real title available?)
- Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Bilevel programming: a survey
- Designing Least-Cost Nonblocking Broadband Networks
- Domination Between Traffic Matrices
- Geometry of cuts and metrics
- Hardness of robust network design
- Metric inequalities and the network loading problem
- Minimum cost capacity installation for multicommodity network flows
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Network Design Using Cut Inequalities
- On cut-based inequalities for capacitated network design polyhedra
- Provisioning a virtual private network: a network design problem for multicommodity flow
- Provisioning virtual private networks under traffic uncertainty
- Robust discrete optimization and network flows
- Robust network design: formulations, valid inequalities, and computations
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Routing of uncertain traffic demands
- Separating tight metric inequalities by bilevel programming
- Solving survivable two-layer network design problems by metric inequalities
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- The convex hull of two core capacitated network design problems
- The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- k-Partition-based facets of the network design problem
Cited in
(29)- 2-stage robust MILP with continuous recourse variables
- Robust Shift Scheduling in Call Centers
- Robust routing and optimal partitioning of a traffic demand polytope
- 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
- Single-commodity robust network design with finite and hose demand sets
- Single-commodity robust network design problem: complexity, instances and heuristic solutions
- Experiments on virtual private network design with concave capacity costs
- The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
- On the approximability of robust network design
- Routing of uncertain traffic demands
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty
- Network design in scarce data environment using moment-based distributionally robust optimization
- Distributionally robust chance-constrained multicommodity network flow problem in dynamic networks: a column-generation approach
- A practicable robust counterpart formulation for decomposable functions: a network congestion case study
- Static and dynamic routing under disjoint dominant extreme demands
- An iterative security game for computing robust and adaptive network flows
- Moment-based distributionally robust joint chance constrained optimization for service network design under demand uncertainty
- Robust network design: formulations, valid inequalities, and computations
- Robust minimum cost flow problem under consistent flow constraints
- Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing
- Solving the bifurcated and nonbifurcated robust network loading problem with \(k\)-adaptive routing
- Affine routing for robust network design
- Robust network design with uncertain outsourcing cost
- Generalized hose uncertainty in single-commodity robust network design
- Robust static and dynamic maximum flows
- Benders decomposition for capacitated network design
- Affine recourse for the robust network design problem: between static and dynamic routing
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
This page was built for publication: The robust network loading problem with dynamic routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377165)
