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,...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Elsevier
2018
|
| Subjects: | |
| Online Access: | https://doaj.org/article/ae62ea4ea7da4507ae647b8dc97ff9ae |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|