{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:13:30Z","timestamp":1771035210847,"version":"3.50.1"},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,8,8]],"date-time":"2014-08-08T00:00:00Z","timestamp":1407456000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s10288-014-0270-7","type":"journal-article","created":{"date-parts":[[2014,8,7]],"date-time":"2014-08-07T10:09:09Z","timestamp":1407406149000},"page":"373-378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty"],"prefix":"10.1007","volume":"12","author":[{"given":"Taehan","family":"Lee","sequence":"first","affiliation":[]},{"given":"Changhyun","family":"Kwon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,8]]},"reference":[{"issue":"4","key":"270_CR1","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s10288-013-0231-6","volume":"11","author":"E \u00c1lvarez-Miranda","year":"2013","unstructured":"\u00c1lvarez-Miranda E, Ljubi\u0107 I, Toth P (2013) A note on the bertsimas and sim algorithm for robust combinatorial optimization problems. 4OR 11(4):349\u2013360","journal-title":"4OR"},{"issue":"1","key":"270_CR2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math Program 98(1):49\u201371","journal-title":"Math Program"},{"issue":"5","key":"270_CR3","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1002\/nav.21540","volume":"60","author":"C Kwon","year":"2013","unstructured":"Kwon C, Lee T, Berglund P (2013) Robust shortest path problems with two uncertain multiplicative cost coefficients. Nav Res Logist 60(5):375\u2013394","journal-title":"Nav Res Logist"},{"issue":"1","key":"270_CR4","first-page":"115","volume":"13","author":"K Park","year":"2007","unstructured":"Park K, Lee K (2007) A note on robust combinatorial optimization problem. Int J Manag Sci 13(1):115\u2013119","journal-title":"Int J Manag Sci"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-014-0270-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-014-0270-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-014-0270-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:59Z","timestamp":1559131979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-014-0270-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,8]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["270"],"URL":"https:\/\/doi.org\/10.1007\/s10288-014-0270-7","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,8]]}}}