Min-sup-min robust combinatorial optimization with few recourse solutions
Year of publication: |
2022
|
---|---|
Authors: | Arslan, Ayşe N. ; Poss, Michael ; Silva, Marco |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 4, p. 2212-2228
|
Subject: | combinatorial optimization | robust optimization | scenario generation | vertex p-center | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Robustes Verfahren | Robust statistics | Scheduling-Verfahren | Scheduling problem |
-
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
Kasperski, Adam, (2013)
-
Robust combinatorial optimization with variable cost uncertainty
Poss, Michael, (2014)
-
Mavrotas, George, (2014)
- More ...
-
Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
Silva, Marco, (2020)
-
Uncertainty reduction in robust optimization
Arslan, Ayşe N., (2024)
-
Deep reinforcement learning for stochastic last-mile delivery with crowdshipping
Silva, Marco Aurelio Costa da, (2023)
- More ...