2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
Year of publication: |
2022
|
---|---|
Authors: | Krumke, Sven O. ; Le, Huy Minh |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 50.2022, 6, p. 732-737
|
Subject: | Scheduling-location | Approximation algorithms | Uncertainty | Robust optimization | Lateness | Algorithmus | Algorithm | Theorie | Theory | Robustes Verfahren | Robust statistics | Mathematische Optimierung | Mathematical programming | Entscheidung unter Unsicherheit | Decision under uncertainty | Risiko | Risk |
-
Goerigk, Marc, (2024)
-
A robust optimization model for a supply chain under uncertainty
Hosseini, Sara, (2014)
-
Formulations and algorithms for the recoverable -robust knapsack problem
Büsing, Christina, (2019)
- More ...
-
Robust absolute single machine makespan scheduling-location problem on trees
Krumke, Sven O., (2020)
-
Robust single machine makespan scheduling with release date uncertainty
Bachtler, Oliver, (2020)
-
The reverse selective balance center location problem on trees
Nguyen Thanh Toan, (2024)
- More ...