iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1002/NET.21807
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T15:51:45Z","timestamp":1724428305990},"reference-count":34,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,2,6]],"date-time":"2018-02-06T00:00:00Z","timestamp":1517875200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2018,7]]},"abstract":"We experiment with an alternative routing scheme for the robust network loading problem with demand uncertainty. Named k<\/jats:italic>\u2010adaptive, it is based on the fact that the decision\u2010maker chooses k<\/jats:italic> second\u2010stage solutions and then commits to one of them only after realization of the uncertainty. This routing scheme, with its corresponding k<\/jats:italic>\u2010partition of the uncertainty set, is dynamically defined under an iterative method to sequentially improve the solution. The method has an inherent characteristic of multiplying the number of variables and constraints after each iteration, so that additional measures are introduced in the solution strategy in order to control time performance. We compare our k<\/jats:italic>\u2010adaptive results with the ones obtained through other routing schemes and also verify the effectiveness of the methods utilized using several realistic networks from SNDlib and other sources.<\/jats:p>","DOI":"10.1002\/net.21807","type":"journal-article","created":{"date-parts":[[2018,2,6]],"date-time":"2018-02-06T15:42:41Z","timestamp":1517931761000},"page":"151-170","source":"Crossref","is-referenced-by-count":7,"title":["Solving the bifurcated and nonbifurcated robust network loading problem with k<\/i>\u2010adaptive routing"],"prefix":"10.1002","volume":"72","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-9757-323X","authenticated-orcid":false,"given":"Marco","family":"Silva","sequence":"first","affiliation":[{"name":"LIA, Universit\u00e9 d'Avignon et des Pays des Vaucluse Avignon France"},{"name":"PESC, Universidade Federal do Rio de Janeiro Rio de Janeiro Brazil"}]},{"given":"Michael","family":"Poss","sequence":"additional","affiliation":[{"name":"UMR CNRS 5506 LIRMM, Universit\u00e9 de Montpellier Montpellier France"}]},{"given":"Nelson","family":"Maculan","sequence":"additional","affiliation":[{"name":"PESC, Universidade Federal do Rio de Janeiro Rio de Janeiro Brazil"}]}],"member":"311","published-online":{"date-parts":[[2018,2,6]]},"reference":[{"key":"e_1_2_8_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10287-016-0249-2"},{"key":"e_1_2_8_3_1","doi-asserted-by":"crossref","unstructured":"W.Ben\u2010Ameur Between fully dynamic routing and robust stable routing 6th International Workshop on Design and Reliable Communication Networks La Rochelle France 2007 pp.1\u20136.","DOI":"10.1109\/DRCN.2007.4762277"},{"key":"e_1_2_8_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-005-1741-7"},{"key":"e_1_2_8_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2013.05.076"},{"key":"e_1_2_8_6_1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050"},{"key":"e_1_2_8_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2049764"},{"key":"e_1_2_8_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2016.1515"},{"key":"e_1_2_8_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1030.0065"},{"key":"e_1_2_8_10_1","doi-asserted-by":"crossref","unstructured":"C.B\u00fcsingandF.D'Andreagiovanni A New Theoretical Framework for Robust Optimization Under Multi\u2010Band Uncertainty Operations Research Proceedings2012 Springer Cham pp.115\u2013121.","DOI":"10.1007\/978-3-319-00795-3_17"},{"key":"e_1_2_8_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1324215.1324236"},{"key":"e_1_2_8_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20165"},{"key":"e_1_2_8_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0086-0"},{"key":"e_1_2_8_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2018.01.024"},{"key":"e_1_2_8_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100263"},{"key":"e_1_2_8_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316209"},{"key":"e_1_2_8_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0866"},{"key":"e_1_2_8_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2620-6"},{"key":"e_1_2_8_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2014.0623"},{"key":"e_1_2_8_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-0208(08)73109-8"},{"key":"e_1_2_8_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-012-9500-0"},{"key":"e_1_2_8_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-017-9956-z"},{"key":"e_1_2_8_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.09.025"},{"key":"e_1_2_8_24_1","unstructured":"O.NohadaniandK.Sharma Optimization under decision\u2010dependent uncertainty arXiv 1611.07992 (2016)."},{"key":"e_1_2_8_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20371"},{"key":"e_1_2_8_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.07.001"},{"key":"e_1_2_8_27_1","doi-asserted-by":"crossref","unstructured":"A.OuorouandJ.\u2010P.Vial A model for robust capacity planning for telecommunications networks under demand uncertainty 6th International Workshop on Design and Reliable Communication Networks La Rochelle France 2007 pp.1\u201314.","DOI":"10.1109\/DRCN.2007.4762287"},{"key":"e_1_2_8_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-012-0217-9"},{"key":"e_1_2_8_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-013-0679-5"},{"key":"e_1_2_8_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21482"},{"key":"e_1_2_8_31_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2016.0696"},{"key":"e_1_2_8_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2009.01.009"},{"key":"e_1_2_8_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2018.01.011"},{"key":"e_1_2_8_34_1","doi-asserted-by":"crossref","unstructured":"M.ZotkiewiczandW.Ben\u2010Ameur More adaptive robust stable routing Proceedings of the Global Communications Conference GLOBECOM Honolulu Hawaii 2009 pp.1\u20136.","DOI":"10.1109\/GLOCOM.2009.5425958"},{"key":"e_1_2_8_35_1","first-page":"935","article-title":"Volume\u2010oriented routing and its modifications","volume":"52","author":"Zotkiewicz M.","year":"2013","journal-title":"Telecommun. Syst."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.21807","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.21807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T12:11:01Z","timestamp":1694520661000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.21807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,6]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["10.1002\/net.21807"],"URL":"https:\/\/doi.org\/10.1002\/net.21807","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,6]]}}}