Robust Metric Inequalities for Network Loading Under Demand Uncertainty
From MaRDI portal
Recommendations
- The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
- Integer Programming and Combinatorial Optimization
- Metric inequalities and the network loading problem
- A Hybrid Polyhedral Uncertainty Model for the Robust Network Loading Problem
- Robust network design in telecommunications under polytope demand uncertainty
- Robust optimization model for a dynamic network design problem under demand uncertainty
- Robust capacity expansion of a network under demand uncertainty: a bi-objective approach
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Dynamic network design problem under demand uncertainty: an adjustable robust optimization approach
Cites work
- A branch-and-cut algorithm for capacitated network design problems
- An improved reduction method for the robust optimization of the assignment problem
- Benders decomposition approach for the robust network design problem with flow bifurcations
- CORRELATIONS IN STOCHASTIC PROGRAMMING: A CASE FROM STOCHASTIC SERVICE NETWORK DESIGN
- Combinatorial approaches to multiflow problems
- Metric inequalities and the network loading problem
- Network Design Using Cut Inequalities
- Polyhedral structure of the 4-node network design problem
- Robust network design: formulations, valid inequalities, and computations
- The Price of Robustness
- The convex hull of two core capacitated network design problems
- The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
- The robust network loading problem with dynamic routing
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- k-Partition-based facets of the network design problem
Cited in
(10)- 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
- On the approximability of robust network design
- A Hybrid Polyhedral Uncertainty Model for the Robust Network Loading Problem
- Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing
- Affine routing for robust network design
- Generalized hose uncertainty in single-commodity robust network design
- The robust network loading problem with dynamic routing
- Metric inequalities and the network loading problem
- Integer Programming and Combinatorial Optimization
This page was built for publication: Robust Metric Inequalities for Network Loading Under Demand Uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455882)
