{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:40Z","timestamp":1720640800971},"reference-count":7,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1016\/j.endm.2018.03.006","type":"journal-article","created":{"date-parts":[[2018,4,12]],"date-time":"2018-04-12T11:23:17Z","timestamp":1523532197000},"page":"39-46","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["A MILP-based VND for the min-max regret Shortest Path Tree Problem with interval costs"],"prefix":"10.1016","volume":"66","author":[{"given":"Iago A.","family":"Carvalho","sequence":"first","affiliation":[]},{"given":"Thiago F.","family":"Noronha","sequence":"additional","affiliation":[]},{"given":"Chistophe","family":"Duhamel","sequence":"additional","affiliation":[]},{"given":"Luiz F.M.","family":"Vieira","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2018.03.006_br0010","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.ifacol.2016.07.649","article-title":"A scenario based heuristic for the robust shortest path tree problem","volume":"49","author":"Carvalho","year":"2016","journal-title":"IFAC-PapersOnLine"},{"key":"10.1016\/j.endm.2018.03.006_br0020","series-title":"XLVIII Simp\u00f3sio Brasileiro de Pesquisa Operacional","first-page":"12","article-title":"Sobre a complexidade do problema da \u00e1rvore de caminhos mais curtos robusta","author":"Carvalho","year":"2016"},{"key":"10.1016\/j.endm.2018.03.006_br0030","series-title":"The robust shortest path problem with interval data","author":"Kara\u015fan","year":"2001"},{"key":"10.1016\/j.endm.2018.03.006_br0040","doi-asserted-by":"crossref","DOI":"10.1109\/MCOM.2007.4378324","article-title":"Multicast routing in wireless mesh networks: Minimum cost trees or shortest path trees?","volume":"45","author":"Nguyen","year":"2007","journal-title":"IEEE Communications Magazine"},{"key":"10.1016\/j.endm.2018.03.006_br0050","article-title":"6LoWPAN: The wireless embedded Internet","volume":"vol. 43","author":"Shelby","year":"2011"},{"key":"10.1016\/j.endm.2018.03.006_br0060","series-title":"RPL: IPv6 Routing Protocol for Low-Power and Lossy Networks","author":"Winter","year":"2012"},{"key":"10.1016\/j.endm.2018.03.006_br0070","series-title":"Spanning Trees and Optimization Problems","first-page":"23","article-title":"Shortest-paths trees","author":"Wu","year":"2004"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065318300520?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065318300520?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T10:24:23Z","timestamp":1534933463000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065318300520"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":7,"alternative-id":["S1571065318300520"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2018.03.006","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2018,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A MILP-based VND for the min-max regret Shortest Path Tree Problem with interval costs","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.endm.2018.03.006","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}