Robust network optimization under polyhedral demand uncertainty is NP-hard
From MaRDI portal
(Redirected from Publication:968181)
Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
Recommendations
Cites work
- A robustness approach to uncapacitated network design problems
- A theorem on flows in networks
- An approach to robust network design in telecommunications
- Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty
- Combinatorial approaches to multiflow problems
- Discrete cost multicommodity network optimization problems and exact solution methods
- Network flows. Theory, algorithms, and applications.
- On 2-stage robust LP with RHS uncertainty: complexity results and applications
- On robust maximum flow with polyhedral uncertainty sets
- On the Existence of a Feasible Flow in a Stochastic Transportation Network
- Partitioning procedures for solving mixed-variables programming problems
- Robust Optimization for Power Systems Capacity Expansion under Uncertainty
- Robust capacity expansion of network flows
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Robust optimization-methodology and applications
- Robust solutions of uncertain linear programs
- Routing of uncertain traffic demands
- The Price of Robustness
- The ellipsoid method and its consequences in combinatorial optimization
- Two-Processor Scheduling with Start-Times and Deadlines
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
Cited in
(23)- A robust optimization model for distribution network design under a mixed integer set of scenarios
- Robust optimization model for a dynamic network design problem under demand uncertainty
- Hardness of robust network design
- Robust capacity assignment solutions for telecommunications networks with uncertain demands
- A Hybrid Polyhedral Uncertainty Model for the Robust Network Loading Problem
- Multipolar robust optimization
- Robust network design in telecommunications under polytope demand uncertainty
- Scenario based robust line balancing: Computational complexity
- Recent advances in robust optimization: an overview
- Affine routing for robust network design
- On robust maximum flow with polyhedral uncertainty sets
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
- On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows
- On the approximability of robust network design
- \(k\)-adaptive routing for the robust network loading problem
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- Multi-service multi-facility network design under uncertainty
- Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
- The maximum flow problem of uncertain network
- On 2-stage robust LP with RHS uncertainty: complexity results and applications
- A comparison of routing sets for robust network design
- The robust network loading problem with dynamic routing
This page was built for publication: Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968181)
