{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T08:25:31Z","timestamp":1724660731854},"reference-count":11,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2005,11]]},"DOI":"10.1016\/j.orl.2004.12.002","type":"journal-article","created":{"date-parts":[[2005,2,11]],"date-time":"2005-02-11T14:15:45Z","timestamp":1108131345000},"page":"634-640","source":"Crossref","is-referenced-by-count":75,"title":["Complexity of the min\u2013max and min\u2013max regret assignment problems"],"prefix":"10.1016","volume":"33","author":[{"given":"Hassene","family":"Aissi","sequence":"first","affiliation":[]},{"given":"Cristina","family":"Bazgan","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Vanderpooten","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2004.12.002_bib1","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/S0167-6377(03)00058-0","article-title":"On the complexity of the robust spanning tree with interval data","volume":"32","author":"Aron","year":"2004","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.orl.2004.12.002_bib2","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/S0166-218X(02)00384-0","article-title":"Complexity of robust single facility location problems on networks with uncertain edge lengths","volume":"127","author":"Averbakh","year":"2003","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.orl.2004.12.002_bib3","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/S0167-6377(03)00091-9","article-title":"Minmax regret linear resource allocation problems","volume":"32","author":"Averbakh","year":"2004","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.orl.2004.12.002_bib4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0166-218X(03)00462-1","article-title":"Interval data min\u2013max regret network optimization problems","volume":"138","author":"Averbakh","year":"2004","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.orl.2004.12.002_bib5","unstructured":"M. Garey, D. Johnson, Computer and Intractability: A Guide to the Theory of NP-Completeness, San Francisco, 1979."},{"key":"10.1016\/j.orl.2004.12.002_bib6","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1002\/nav.3800100132","article-title":"A note on shortest path, assignment and transportation problems","volume":"10","author":"Hoffman","year":"1963","journal-title":"Nav. Res. Logist. Quart."},{"key":"10.1016\/j.orl.2004.12.002_bib7","unstructured":"O.E. Kara\u015fan, M.C. Pinar, H. Yaman, The robust shortest path problem with interval data, 2001, available from http:\/\/www.optimization-online.org."},{"key":"10.1016\/j.orl.2004.12.002_bib8","series-title":"Robust Discrete Optimization and its Application","doi-asserted-by":"crossref","author":"Kouvelis","year":"1997","DOI":"10.1007\/978-1-4757-2620-6"},{"key":"10.1016\/j.orl.2004.12.002_bib9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The hungarian method for the assignment problem","volume":"2","author":"Kuhn","year":"1955","journal-title":"Nav. Res. Logist. Quart."},{"key":"10.1016\/j.orl.2004.12.002_bib10","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":"Oper. Res. Lett."},{"key":"10.1016\/j.orl.2004.12.002_bib11","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0305-0548(97)00085-3","article-title":"On the robust shortest path","volume":"6","author":"Yu","year":"1998","journal-title":"Comput. Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704001658?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704001658?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T18:53:04Z","timestamp":1548701584000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637704001658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["S0167637704001658"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2004.12.002","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2005,11]]}}}