A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Robust network optimization under polyhedral demand uncertainty is NP-hard
2010
Discrete Applied Mathematics
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
doi:10.1016/j.dam.2009.09.025
fatcat:qhta5zibj5hpjagz53vaiwhnfu