{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T14:42:48Z","timestamp":1724424168954},"reference-count":5,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2010,11,1]],"date-time":"2010-11-01T00:00:00Z","timestamp":1288569600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"crossref","award":["EP\/F017871"],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Netherlands Organization for Scientific Research","award":["639.033.403"]},{"name":"DIAMANT"},{"name":"BSIK","award":["03018"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Optimization"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1016\/j.disopt.2010.03.008","type":"journal-article","created":{"date-parts":[[2010,5,11]],"date-time":"2010-05-11T11:53:02Z","timestamp":1273578782000},"page":"191-196","source":"Crossref","is-referenced-by-count":17,"title":["Pinpointing the complexity of the interval min\u2013max regret knapsack problem"],"prefix":"10.1016","volume":"7","author":[{"given":"Vladimir G.","family":"Deineko","sequence":"first","affiliation":[]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disopt.2010.03.008_b1","series-title":"Robust Discrete Optimization and its Applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","author":"Kouvelis","year":"1997"},{"key":"10.1016\/j.disopt.2010.03.008_b2","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","article-title":"Minmax and minmax regret versions of combinatorial optimization problems: a survey","volume":"197","author":"Aissi","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.disopt.2010.03.008_b3","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/j.disopt.2010.03.008_b4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0167-6377(01)00078-5","article-title":"The robust spanning tree problem with interval data","volume":"29","author":"Yaman","year":"2001","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.disopt.2010.03.008_b5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoretical Computer Science"}],"container-title":["Discrete Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157252861000023X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157252861000023X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,11]],"date-time":"2018-12-11T07:22:34Z","timestamp":1544512954000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157252861000023X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["S157252861000023X"],"URL":"https:\/\/doi.org\/10.1016\/j.disopt.2010.03.008","relation":{},"ISSN":["1572-5286"],"issn-type":[{"value":"1572-5286","type":"print"}],"subject":[],"published":{"date-parts":[[2010,11]]}}}