Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
Year of publication: |
2013
|
---|---|
Authors: | Kasperski, Adam ; Zieliński, Paweł |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 41.2013, 6, p. 639-643
|
Subject: | Combinatorial optimization | Robust optimization | Computational complexity | OWA criterion | Bottleneck problems | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Engpass | Bottleneck | Mathematik | Mathematics |
-
Multi-level bottleneck assignment problems : complexity and sparsity-exploiting formulations
Dokka, Trivikram, (2023)
-
On the maximum small-world subgraph problem
Kim, Jongeun, (2020)
-
A robust optimization approach for the multi-mode resource-constrained project scheduling problem
Balouka, Noemie, (2021)
- More ...
-
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
Kasperski, Adam, (2012)
-
Robust recoverable 0-1 optimization problems under polyhedral uncertainty
Hradovich, Mikita, (2019)
-
Risk-averse single machine scheduling : complexity and approximation
Kasperski, Adam, (2019)
- More ...