A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Lee, Taehan | ko |
| dc.contributor.author | Kwon, Changhyun | ko |
| dc.date.accessioned | 2023-08-31T02:02:38Z | - |
| dc.date.available | 2023-08-31T02:02:38Z | - |
| dc.date.created | 2023-08-30 | - |
| dc.date.created | 2023-08-30 | - |
| dc.date.issued | 2014-12 | - |
| dc.identifier.citation | 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, v.12, no.4, pp.373 - 378 | - |
| dc.identifier.issn | 1619-4500 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/312022 | - |
| dc.description.abstract | 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. | - |
| dc.language | English | - |
| dc.publisher | SPRINGER HEIDELBERG | - |
| dc.title | A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000345583600004 | - |
| dc.identifier.scopusid | 2-s2.0-84912574235 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 12 | - |
| dc.citation.issue | 4 | - |
| dc.citation.beginningpage | 373 | - |
| dc.citation.endingpage | 378 | - |
| dc.citation.publicationname | 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH | - |
| dc.identifier.doi | 10.1007/s10288-014-0270-7 | - |
| dc.contributor.localauthor | Kwon, Changhyun | - |
| dc.contributor.nonIdAuthor | Lee, Taehan | - |
| dc.description.isOpenAccess | N | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordAuthor | Robust combinatorial optimization | - |
| dc.subject.keywordAuthor | Discrete optimization | - |
- 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.