{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:23Z","timestamp":1720640783488},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"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,2]]},"DOI":"10.1016\/j.endm.2018.01.011","type":"journal-article","created":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T16:49:13Z","timestamp":1519318153000},"page":"95-104","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["k-Adaptive Routing for the Robust Network Loading Problem"],"prefix":"10.1016","volume":"64","author":[{"given":"Marco","family":"Silva","sequence":"first","affiliation":[]},{"given":"Michael","family":"Poss","sequence":"additional","affiliation":[]},{"given":"Nelson","family":"Maculan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.endm.2018.01.011_br0010","first-page":"307","article-title":"Robust routing and optimal partitioning of a traffic demand polytope","volume":"18","author":"Ben-Ameur","year":"2011","journal-title":"ITOR"},{"issue":"12","key":"10.1016\/j.endm.2018.01.011_br0020","doi-asserted-by":"crossref","first-page":"2751","DOI":"10.1109\/TAC.2010.2049764","article-title":"Finite Adaptability in Multistage Linear Optimization","volume":"55","author":"Bertsimas","year":"2010","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"4","key":"10.1016\/j.endm.2018.01.011_br0030","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1287\/opre.2016.1515","article-title":"Multistage Robust Mixed-Integer Optimization with Adaptive Partitions","volume":"64","author":"Bertsimas","year":"2016","journal-title":"Oper Res"},{"issue":"1","key":"10.1016\/j.endm.2018.01.011_br0040","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","article-title":"The Price of Robustness","volume":"52","author":"Bertsimas","year":"2004","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.endm.2018.01.011_br0050","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1002\/net.21497","article-title":"Robust network design: Formulations, valid inequalities, and computations","volume":"61","author":"Koster","year":"2013","journal-title":"Networks"},{"key":"10.1016\/j.endm.2018.01.011_br0060","author":"Lubin"},{"issue":"3","key":"10.1016\/j.endm.2018.01.011_br0070","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/s10589-012-9500-0","article-title":"The robust network loading problem with dynamic routing","volume":"54","author":"Mattia","year":"2013","journal-title":"Comp. Opt. and Appl."},{"key":"10.1016\/j.endm.2018.01.011_br0080","author":"Mattia"},{"issue":"5","key":"10.1016\/j.endm.2018.01.011_br0090","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.dam.2009.09.025","article-title":"Robust network optimization under polyhedral demand uncertainty is NP-hard","volume":"158","author":"Minoux","year":"2010","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"10.1016\/j.endm.2018.01.011_br0100","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","article-title":"SNDlib 1.0 - Survivable Network Design Library","volume":"55","author":"Orlowski","year":"2010","journal-title":"Networks"},{"key":"10.1016\/j.endm.2018.01.011_br0110","doi-asserted-by":"crossref","unstructured":"A. Ouorou, J.-P. Vial, A model for robust capacity planning for telecommunications networks under demand uncertainty, in: Proc 6th Int Workshop Design Reliable Commun Networks, 2007, pp. 1\u20134.","DOI":"10.1109\/DRCN.2007.4762287"},{"issue":"1","key":"10.1016\/j.endm.2018.01.011_br0120","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/j.cor.2012.07.001","article-title":"Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty","volume":"40","author":"Ouorou","year":"2013","journal-title":"Computers & OR"},{"issue":"5","key":"10.1016\/j.endm.2018.01.011_br0130","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1007\/s11590-013-0679-5","article-title":"A comparison of routing sets for robust network design","volume":"8","author":"Poss","year":"2014","journal-title":"Optimization Letters"},{"issue":"2","key":"10.1016\/j.endm.2018.01.011_br0140","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1002\/net.21482","article-title":"Affine recourse for the robust network design problem: Between static and dynamic routing","volume":"61","author":"Poss","year":"2013","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.endm.2018.01.011_br0150","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1287\/ijoc.2016.0696","article-title":"Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set","volume":"28","author":"Postek","year":"2016","journal-title":"INFORMS Journal on Computing"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065318300118?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065318300118?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T12:31:35Z","timestamp":1719837095000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065318300118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":15,"alternative-id":["S1571065318300118"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2018.01.011","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2018,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"k-Adaptive Routing for the Robust Network Loading Problem","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.01.011","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"}]}}
