On the existence of a feasible flow in a stochastic transportation network
Operations Research
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Operations Research
Two-Stage Robust Network Flow and Design Under Demand Uncertainty
Operations Research
Robust solutions of uncertain linear programs
Operations Research Letters
On 2-stage robust LP with RHS uncertainty: complexity results and applications
Journal of Global Optimization
An exact algorithm for robust network design
INOC'11 Proceedings of the 5th international conference on Network optimization
Affine decision rules for tractable approximations to robust capacity planning in telecommunications
INOC'11 Proceedings of the 5th international conference on Network optimization
Scenario based robust line balancing: Computational complexity
Discrete Applied Mathematics
Computers and Operations Research
The robust network loading problem with dynamic routing
Computational Optimization and Applications
The maximum flow problem of uncertain network
Information Sciences: an International Journal
Hi-index | 0.05 |
Minimum cost network design/dimensioning problems where feasibility has to be ensured w.r.t. a given (possibly infinite) set of scenarios of requirements form an important subclass of robust LP problems with right-hand side uncertainty. Such problems arise in many practical contexts such as Telecommunications, logistic networks, power distribution networks, etc. Though some evidence of the computational difficulty of such problems can be found in the literature, no formal NP-hardness proof was available up to now. In the present paper, this pending complexity issue is settled for all robust network optimization problems featuring polyhedral demand uncertainty, both for the single-commodity and multicommodity case, even if the corresponding deterministic versions are polynomially solvable as regular (continuous) linear programs. A new family of polynomially solvable instances is also discussed.