A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
Robust combinatorial optimization problems with cardinality constrained uncertainty may be solved by a finite number of nominal problems. In this paper, we show that the number of nominal problems to be solved can be reduced significantly.
Saved in:
Published in | 4OR Vol. 12; no. 4; pp. 373 - 378 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.12.2014
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Robust combinatorial optimization problems with cardinality constrained uncertainty may be solved by a finite number of nominal problems. In this paper, we show that the number of nominal problems to be solved can be reduced significantly. |
---|---|
ISSN: | 1619-4500 1614-2411 |
DOI: | 10.1007/s10288-014-0270-7 |