Complexity and in-approximability of a selection problem in robust optimization
Vladimir G. Deineko; Gerhard J. Woeginger
| Year of publication: |
2013
|
|---|---|
| Authors: | Deineko, Vladimir G. ; Woeginger, Gerhard J. |
| Published in: |
4OR : a quarterly journal of operations research. - Berlin, Heidelberg : Springer, ZDB-ID 2127815-5. - Vol. 11.2013, 3, p. 249-252
|
| Subject: | Combinatorial optimization | Computational complexity | Robust optimization | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Robustes Verfahren | Robust statistics |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://ebvufind01.dmz1.zbw.eu/10010205348