Robust combinatorial optimization under convex and discrete cost uncertainty
In this survey, we discuss the state of the art of robust combinatorial optimization under uncertain cost functions. We summarize complexity results presented in the literature for various underlying problems, with the aim of pointing out the connections between the different results and approaches,...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Elsevier
2018
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/ae62ea4ea7da4507ae647b8dc97ff9ae |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Soyez le premier à ajouter un commentaire!