{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T22:05:33Z","timestamp":1657404333250},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"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":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s13675-018-0102-1","type":"journal-article","created":{"date-parts":[[2018,9,5]],"date-time":"2018-09-05T14:04:16Z","timestamp":1536156256000},"page":"207-209","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Special issue on: robust combinatorial optimization"],"prefix":"10.1016","volume":"6","author":[{"given":"Arie M.C.A.","family":"Koster","sequence":"first","affiliation":[]},{"given":"Michael","family":"Poss","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1007\/s13675-018-0102-1_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Ameur W, Ouorou A, Wang G, Zotkiewicz M (2017) Multipolar robust optimization. EURO J Comput Optim. 10.1007\/s13675-017-0092-4","DOI":"10.1007\/s13675-017-0092-4"},{"key":"10.1007\/s13675-018-0102-1_CR2","series-title":"Robust optimization","author":"Ben-Tal","year":"2009"},{"key":"10.1007\/s13675-018-0102-1_CR3","doi-asserted-by":"crossref","unstructured":"Buchheim C, Kurtz J (2018) Robust combinatorial optimization under convex and discrete cost uncertainty. EURO J Comput Optim. 10.1007\/s13675-018-0103-0","DOI":"10.1007\/s13675-018-0103-0"},{"key":"10.1007\/s13675-018-0102-1_CR4","doi-asserted-by":"crossref","unstructured":"B\u00fcsing C, Knust S, Le XT (2018) Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation. EURO J Comput Optim. 10.1007\/s13675-018-0094-x","DOI":"10.1007\/s13675-018-0094-x"},{"key":"10.1007\/s13675-018-0102-1_CR5","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1287\/mnsc.1.3-4.197","article-title":"Linear programming under uncertainty","volume":"50","author":"Dantzig","year":"1955","journal-title":"Manag Sci"},{"key":"10.1007\/s13675-018-0102-1_CR6","doi-asserted-by":"crossref","unstructured":"Ficker A, Spieksma F, Woeginger G (2018) Robust balanced optimization. EURO J Comput Optim. 10.1007\/s13675-018-0093-y","DOI":"10.2139\/ssrn.3134369"},{"key":"10.1007\/s13675-018-0102-1_CR7","doi-asserted-by":"crossref","unstructured":"Gabrel V, Murat C, Thiele A (2018) Portfolio optimization with pw-robustness. EURO J Comput Optim. 10.1007\/s13675-018-0096-8","DOI":"10.1007\/s13675-018-0096-8"},{"key":"10.1007\/s13675-018-0102-1_CR8","doi-asserted-by":"crossref","unstructured":"Hamaz I, Houssin L, Cafieri S (2018) A robust basic cyclic scheduling problem. EURO J Comput Optim. 10.1007\/s13675-018-0100-3","DOI":"10.1007\/s13675-018-0100-3"},{"key":"10.1007\/s13675-018-0102-1_CR9","doi-asserted-by":"crossref","unstructured":"Kargar K, Bayrak HI, Pinar M (2018) Robust bilateral trade with discrete types. EURO J Comput Optim (under revision)","DOI":"10.1007\/s13675-018-0106-x"},{"key":"10.1007\/s13675-018-0102-1_CR10","doi-asserted-by":"crossref","unstructured":"Kurtz J (2018) Robust combinatorial optimization under budgeted-ellipsoidal uncertainty. EURO J Comput Optim. 10.1007\/s13675-018-0097-7","DOI":"10.1007\/s13675-018-0097-7"},{"key":"10.1007\/s13675-018-0102-1_CR11","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","article-title":"Convex programming with set-inclusive constraints and applications to inexact linear programming","volume":"21","author":"Soyster","year":"1973","journal-title":"Oper Res"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-018-0102-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-018-0102-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001003?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001003?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-018-0102-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:24:18Z","timestamp":1648632258000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621001003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["S2192440621001003"],"URL":"https:\/\/doi.org\/10.1007\/s13675-018-0102-1","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2018,9]]},"assertion":[{"value":"1 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}