Robust Network Design with Uncertain Outsourcing Cost
From MaRDI portal
Publication:3458750
DOI10.1287/ijoc.2015.0643zbMath1328.90023OpenAlexW1823558250MaRDI QIDQ3458750
Artur Alves Pessoa, Michael Poss
Publication date: 21 December 2015
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2015.0643
convex optimizationlinear multiplicative programmingrobust optimizationnetwork designrandom recourse
Convex programming (90C25) Minimax problems in mathematical programming (90C47) Communication networks in operations research (90B18)
Related Items (8)
Robust optimization for non-linear impact of data variation ⋮ Robust combinatorial optimization with knapsack uncertainty ⋮ Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions ⋮ The Distributionally Robust Chance-Constrained Vehicle Routing Problem ⋮ Reducing Conservatism in Robust Optimization ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ A Dynamic Programming Approach for a Class of Robust Optimization Problems ⋮ Optimizing subscriber migrations for a telecommunication operator in uncertain context
Uses Software
Cites Work
- Robust combinatorial optimization with variable cost uncertainty
- Exact solution of the robust knapsack problem
- Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
- A comparison of routing sets for robust network design
- Robust network design in telecommunications under polytope demand uncertainty
- Adjustable robust solutions of uncertain linear programs
- Robust combinatorial optimization with variable budgeted uncertainty
- The robust network loading problem with dynamic routing
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- \(NP\)-hardness of linear multiplicative programming and related problems
- Robust capacity assignment solutions for telecommunications networks with uncertain demands
- The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
- Theory and Applications of Robust Optimization
- Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models
- A Survey of Algorithms for Convex Multicommodity Flow Problems
- The Price of Robustness
- CSDP 2.3 user's guide
- Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Robust network design: Formulations, valid inequalities, and computations
- Affine recourse for the robust network design problem: Between static and dynamic routing
- Stochastic Programs with Recourse: Random Recourse Costs Only
- A Survey of the S-Lemma
- Benchmarking optimization software with performance profiles.
- Unnamed Item
This page was built for publication: Robust Network Design with Uncertain Outsourcing Cost
