Robust network design with uncertain outsourcing cost
From MaRDI portal
Publication:3458750
Recommendations
- Robust capacity assignment solutions for telecommunications networks with uncertain demands
- An approach to robust network design in telecommunications
- Robust network design: formulations, valid inequalities, and computations
- Robust network design in telecommunications under polytope demand uncertainty
- Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty
Cites work
- \(NP\)-hardness of linear multiplicative programming and related problems
- A comparison of routing sets for robust network design
- A survey of algorithms for convex multicommodity flow problems
- A Survey of the S-Lemma
- Adjustable robust solutions of uncertain linear programs
- Affine recourse for the robust network design problem: between static and dynamic routing
- Benchmarking optimization software with performance profiles.
- CSDP 2.3 user's guide
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models
- Exact solution of the robust knapsack problem
- Robust capacity assignment solutions for telecommunications networks with uncertain demands
- Robust combinatorial optimization with variable budgeted uncertainty
- Robust combinatorial optimization with variable cost uncertainty
- Robust network design in telecommunications under polytope demand uncertainty
- Robust network design: formulations, valid inequalities, and computations
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Stochastic Programs with Recourse: Random Recourse Costs Only
- Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
- The Price of Robustness
- The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
- The robust network loading problem with dynamic routing
- Theory and applications of robust optimization
- Towards a combination of interval and ellipsoid uncertainty
- Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
Cited in
(10)- Robust optimization for non-linear impact of data variation
- Robust combinatorial optimization with knapsack uncertainty
- Optimizing subscriber migrations for a telecommunication operator in uncertain context
- A dynamic programming approach for a class of robust optimization problems
- Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions
- The distributionally robust chance-constrained vehicle routing problem
- Reducing Conservatism in Robust Optimization
- Designing robust coverage networks to hedge against worst-case facility losses
- Deterministic risk control for cost-effective network connections
- Robust combinatorial optimization under convex and discrete cost uncertainty
This page was built for publication: Robust network design with uncertain outsourcing cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3458750)
