Name
Title | ||
|---|---|---|
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion |
Abstract | ||
|---|---|---|
In this paper a class of bottleneck combinatorial optimization problems with uncertain costs is discussed. The uncertainty is modeled by specifying a discrete scenario set containing a finite number of cost vectors, called scenarios. In order to choose a solution the Ordered Weighted Averaging aggregation operator (OWA for short) is applied. The OWA operator generalizes traditional criteria in decision making under uncertainty such as the maximum, minimum, average, median, or Hurwicz criterion. New complexity and approximation results in this area are provided. These results are general and remain valid for many problems, in particular for a wide class of network problems. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.orl.2013.08.014 | Operations Research Letters |
Keywords | DocType | Volume |
combinatorial optimization,computational complexity,robust optimization | Journal | 41 |
Issue | ISSN | Citations |
6 | 0167-6377 | 3 |
PageRank | References | Authors |
0.40 | 15 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adam Kasperski | 1 | 352 | 33.64 |
| Paweł Zieliński | 2 | 227 | 28.62 |