Approximating combinatorial optimization problems with the ordered weighted averaging criterion
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 |
-
Goerigk, Marc, (2023)
-
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
Baïou, Mourad, (2023)
-
Generating hard instances for robust combinatorial optimization
Goerigk, Marc, (2020)
- More ...
-
On recoverable and two-stage robust selection problems with budgeted uncertainty
Chassein, André, (2018)
-
Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
Chassein, André, (2018)
-
The quadratic shortest path problem : complexity, approximability, and solution methods
Rostami, Borzou, (2018)
- More ...