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.
- Publisher
- SPRINGER HEIDELBERG
- Issue Date
- 2014-12
- Language
- English
- Article Type
- Article
- Citation
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, v.12, no.4, pp.373 - 378
- ISSN
- 1619-4500
- Appears in Collection
- IE-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 15 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.