Approximating combinatorial optimization problems with the ordered weighted averaging criterion
André Chassein, Marc Goerigk, Adam Kasperski, Paweł Zieliński
| Year of publication: |
2020
|
|---|---|
| Authors: | Chassein, André ; Goerigk, Marc ; Kasperski, Adam ; Zieliński, Paweł |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 286.2020, 3 (1.11.), p. 828-838
|
| Subject: | Approximation algorithms | Combinatorial optimization | Ordered weighted averaging | Robustness and sensitivity analysis | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Sensitivitätsanalyse | Sensitivity analysis | Scheduling-Verfahren | Scheduling problem | Robustes Verfahren | Robust statistics |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.ejor.2020.04.018 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012291575