A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
Year of publication: |
2014
|
---|---|
Authors: | Lee, Taehan ; Kwon, Changhyun |
Published in: |
4OR : a quarterly journal of operations research. - Berlin, Heidelberg : Springer, ZDB-ID 2127815-5. - Vol. 12.2014, 4, p. 373-378
|
Subject: | Robust combinatorial optimization | Discrete optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Robustes Verfahren | Robust statistics | Scheduling-Verfahren | Scheduling problem |
-
Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
Chassein, André, (2018)
-
A robust p-Center problem under pressure to locate shelters in wildfire context
Demange, Marc, (2020)
-
Pang, Zhan, (2021)
- More ...
-
Robust shortest path problems with two uncertain multiplicative cost coefficients
Kwon, Changhyun, (2013)
-
Lee, Taehan, (2001)
-
Lee, Taehan, (2001)
- More ...