Login / Signup
Robust network optimization under polyhedral demand uncertainty is NP-hard.
Michel Minoux
Published in:
Discret. Appl. Math. (2010)
Keyphrases
</>
np hard
optimal solution
distribution network
robust optimization
special case
scheduling problem
stochastic optimization
multi agent systems
worst case
optimization problems
linear programming
convex hull
approximation algorithms
max min
demand uncertainty