{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:46:18Z","timestamp":1743000378656,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662455227"},{"type":"electronic","value":"9783662455234"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45523-4_2","type":"book-chapter","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T17:04:26Z","timestamp":1417539866000},"page":"15-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Hybrid Primal Heuristic for Robust Multiperiod Network Design"],"prefix":"10.1007","author":[{"given":"Fabio","family":"D\u2019Andreagiovanni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonatan","family":"Krolikowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonad","family":"Pulaj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,29]]},"reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"178-","DOI":"10.1109\/MCOM.2014.6736760","volume":"52","author":"T Bauschert","year":"2014","unstructured":"Bauschert, T., B\u00fcsing, C., D\u2019Andreagiovanni, F., Koster, A.M.C.A., Kutschka, M., Steglich, U.: Network planning under demand uncertainty with robust optimization. IEEE Communications Magazine 52(2), 178-\u2013185 (2014). doi:10.1109\/MCOM.2014.6736760","journal-title":"IEEE Communications Magazine"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.20171","volume":"50","author":"B Lardeux","year":"2007","unstructured":"Lardeux, B., Nace, D., Geffard, J.: Multiperiod network design with incremental routing. Networks 50(1), 109\u2013117 (2007)","journal-title":"Networks"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1016\/j.ejor.2011.11.004","volume":"219","author":"I Gamvros","year":"2012","unstructured":"Gamvros, I., Raghavan, S.: Multi-period traffic routing in satellite networks. Europ. J. Oper. Res. 219(3), 738\u2013750 (2012)","journal-title":"Europ. J. Oper. Res."},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-642-30850-5_7","volume-title":"Experimental Algorithms","author":"C B\u00fcsing","year":"2012","unstructured":"B\u00fcsing, C., D\u2019Andreagiovanni, F.: New Results about Multi-band Uncertainty in Robust Optimization. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 63\u201374. Springer, Heidelberg (2012)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-00795-3_17","volume-title":"Operations Research Proceedings 2012","author":"C B\u00fcsing","year":"2014","unstructured":"B\u00fcsing, C., D\u2019Andreagiovanni, F.: A new theoretical framework for robust optimization under multi-band uncertainty. In: Helber, S., et al. (eds.) Operations Research Proceedings 2012, pp. 115\u2013121. Springer, Heidelberg (2014)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"B\u00fcsing, C., D\u2019Andreagiovanni, F., Raymond, A.: 0\u20131 multiband robust optimization. In: Huisman, D., et al. (eds.) Operations Research Proceedings 2013. pp. 89\u201395. Springer, Heidelberg (to appear, 2014)","DOI":"10.1007\/978-3-319-07001-8_13"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E Danna","year":"2005","unstructured":"Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxation induced neighborhoods to improve mip solutions. Math. Program. 102, 71\u201390 (2005)","journal-title":"Math. Program."},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M Dorigo","year":"1999","unstructured":"Dorigo, M., Di Caro, G., Gambardella, L.: Ant algorithms for discrete optimization. Artificial Life 5(2), 137\u2013172 (1999)","journal-title":"Artificial Life"},{"issue":"3","key":"2_CR10","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","volume":"55","author":"S Orlowski","year":"2010","unstructured":"Orlowski, S., Wess\u00e4ly, R., Pioro, M., Tomaszewski, A.: SnDlib 1.0 - survivable network design library. Networks 55(3), 276\u2013286 (2010)","journal-title":"Networks"},{"key":"2_CR11","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River (1993)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Bley, A., Gr\u00f6tschel, M., Wess\u00e4ly, R.: Design of broadband virtual private networks: Model and heuristic for the b-win. vol. 53. DIMACS SDMTCS, pp. 1\u201316 (2000)","DOI":"10.1090\/dimacs\/053\/01"},{"key":"2_CR13","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Springer, Heidelberg (2009)"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-20520-0_2","volume-title":"Applications of Evolutionary Computation","author":"F D\u2019Andreagiovanni","year":"2011","unstructured":"D\u2019Andreagiovanni, F.: On Improving the Capacity of Solving Large-scale Wireless Network Design Problems by Genetic Algorithms. In: Di Chio, C., Brabazon, A., Di Caro, G.A., Drechsler, R., Farooq, M., Grahl, J., Greenfield, G., Prins, C., Romero, J., Squillero, G., Tarantino, E., Tettamanzi, A.G.B., Urquhart, N., Uyar, A.\u015e. (eds.) EvoApplications 2011, Part II. LNCS, vol. 6625, pp. 11\u201320. Springer, Heidelberg (2011)"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-21527-8_7","volume-title":"Network Optimization","author":"F D\u2019Andreagiovanni","year":"2011","unstructured":"D\u2019Andreagiovanni, F., Mannino, C., Sassano, A.: Negative Cycle Separation in Wireless Network Design. In: Pahl, J., Reiners, T., Vo\u00df, S. (eds.) INOC 2011. LNCS, vol. 6701, pp. 51\u201356. Springer, Heidelberg (2011)"},{"issue":"3","key":"2_CR16","doi-asserted-by":"publisher","first-page":"442","DOI":"10.3390\/a6030442","volume":"6","author":"Y Kambayashi","year":"2013","unstructured":"Kambayashi, Y.: A review of routing protocols based on ant-like mobile agents. Algorithms 6(3), 442\u2013456 (2013)","journal-title":"Algorithms"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: Optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. B 26(1), 29\u201341 (1996)","journal-title":"IEEE Trans. Syst. Man Cybern. B"},{"issue":"3","key":"2_CR18","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1016\/j.ejor.2012.02.038","volume":"220","author":"LM Gambardella","year":"2012","unstructured":"Gambardella, L.M., Montemanni, R., Weyland, D.: Coupling ant colony systems with strong local searches. Europ. J. Oper. Res. 220(3), 831\u2013843 (2012)","journal-title":"Europ. J. Oper. Res."},{"issue":"4","key":"2_CR19","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1287\/ijoc.11.4.358","volume":"11","author":"V Maniezzo","year":"1999","unstructured":"Maniezzo, V.: Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS J. Comp. 11(4), 358\u2013369 (1999)","journal-title":"INFORMS J. Comp."}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45523-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T14:46:48Z","timestamp":1717598808000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-45523-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662455227","9783662455234"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45523-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"29 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}