{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:23Z","timestamp":1740107843573,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2018,8,29]],"date-time":"2018-08-29T00:00:00Z","timestamp":1535500800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003407","name":"MIUR","doi-asserted-by":"crossref","award":["PRIN 2015B5F27W","PRIN 20153TXRX9"],"award-info":[{"award-number":["PRIN 2015B5F27W","PRIN 20153TXRX9"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s00500-018-3443-z","type":"journal-article","created":{"date-parts":[[2018,8,29]],"date-time":"2018-08-29T21:33:09Z","timestamp":1535578389000},"page":"2911-2921","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["MIP-based heuristic approaches for the capacitated edge activation problem: the effect of non-compactness"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5054-731X","authenticated-orcid":false,"given":"Sara","family":"Mattia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,29]]},"reference":[{"issue":"Part A","key":"3443_CR1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.comnet.2014.10.004","volume":"75","author":"B Addis","year":"2014","unstructured":"Addis B, Capone A, Carello G, Gianoli L, Sans\u00f3 B (2014) On the energy cost of robustness and resiliency in IP networks. Comput Netw 75(Part A):239\u2013259","journal-title":"Comput Netw"},{"issue":"1","key":"3443_CR2","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1002\/net.21717","volume":"69","author":"B Addis","year":"2017","unstructured":"Addis B, Carello G, Mattia S (2017) Survivable green traffic engineering with shared protection. Networks 69(1):6\u201322","journal-title":"Networks"},{"issue":"3","key":"3443_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1002\/net.20098","volume":"47","author":"Y Agarwal","year":"2006","unstructured":"Agarwal Y (2006) K-partition-based facets of the network design problem. Networks 47(3):123\u2013139","journal-title":"Networks"},{"key":"3443_CR4","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.ejor.2016.09.015","volume":"258","author":"Y Agarwal","year":"2017","unstructured":"Agarwal Y, Aneja Y (2017) Fixed charge multicommodity network design using p-partition facets. Eur J Oper Res 258:124\u2013135","journal-title":"Eur J Oper Res"},{"issue":"6","key":"3443_CR5","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1016\/j.comnet.2013.02.006","volume":"57","author":"E Amaldi","year":"2013","unstructured":"Amaldi E, Capone A, Gianoli L (2013) Energy-aware ip traffic engineering with shortest path routing. Comput Netw 57(6):1503\u20131517","journal-title":"Comput Netw"},{"key":"3443_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.disopt.2006.10.002","volume":"4","author":"P Avella","year":"2007","unstructured":"Avella P, Mattia S, Sassano A (2007) Metric inequalities and the network loading problem. Disc Opt 4:103\u2013114","journal-title":"Disc Opt"},{"key":"3443_CR7","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numer Math 4:238\u2013252","journal-title":"Numer Math"},{"key":"3443_CR8","first-page":"177","volume":"81","author":"D Bienstock","year":"1998","unstructured":"Bienstock D, Chopra S, G\u00fcnl\u00fck O, Tsai C-Y (1998) Minimum cost capacity installation for multicommodity network flows. Math Progr B 81:177\u2013199","journal-title":"Math Progr B"},{"key":"3443_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.disopt.2006.10.007","volume":"4","author":"D Bienstock","year":"2007","unstructured":"Bienstock D, Mattia S (2007) Using mixed-integer programming to solve power grid blackout problems. Disc Opt 4:115\u2013141","journal-title":"Disc Opt"},{"key":"3443_CR10","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1023\/B:HEUR.0000045323.83583.bd","volume":"10","author":"T Crainic","year":"2004","unstructured":"Crainic T, Gendreau M, Hernu G (2004) A slope scaling\/lagrangian perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. J Heur 10:525\u2013545","journal-title":"J Heur"},{"key":"3443_CR11","doi-asserted-by":"publisher","first-page":"2602","DOI":"10.1016\/j.cor.2005.07.015","volume":"33","author":"T Crainic","year":"2006","unstructured":"Crainic T, Li Y, Toulouse M (2006) A first multilevel cooperative algorithm for capacitated multicommodity network design. Comput Oper Res 33:2602\u201322","journal-title":"Comput Oper Res"},{"issue":"5","key":"3443_CR12","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1016\/j.orl.2009.05.007","volume":"37","author":"B Fortz","year":"2009","unstructured":"Fortz B, Poss M (2009) An improved benders decomposition applied to a multi-layer network design problem. Oper Res Lett 37(5):777\u2013795","journal-title":"Oper Res Lett"},{"key":"3443_CR13","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.51.4.655.16098","volume":"51","author":"I Ghamlouche","year":"2003","unstructured":"Ghamlouche I, Crainic T, Gendreau M (2003) Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Oper Res 51:655\u2013667","journal-title":"Oper Res"},{"key":"3443_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/B:ANOR.0000039515.90453.1d","volume":"131","author":"I Ghamlouche","year":"2004","unstructured":"Ghamlouche I, Crainic T, Gendreau M (2004) Path relinking, cycle-based neighborhoods and capacitated multicommodity network design. Ann Oper Res 131:109\u2013133","journal-title":"Ann Oper Res"},{"key":"3443_CR15","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.cor.2014.09.006","volume":"54","author":"G Ghiani","year":"2015","unstructured":"Ghiani G, Laporte G, Manni E (2015) Model-based automatic neighborhood design by unsupervised learning. Comput Oper Res 54:108\u2013116","journal-title":"Comput Oper Res"},{"key":"3443_CR16","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","volume":"48","author":"K Holmberg","year":"2000","unstructured":"Holmberg K, Yuan D (2000) A lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Oper Res 48:461\u2013481","journal-title":"Oper Res"},{"key":"3443_CR17","first-page":"129","volume":"13","author":"M Iri","year":"1971","unstructured":"Iri M (1971) On an extension of the max-flow min-cut theorem to multicommodity flows. J Oper Res Soc Jpn 13:129\u2013135","journal-title":"J Oper Res Soc Jpn"},{"issue":"1","key":"3443_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.21486","volume":"62","author":"C Lee","year":"2013","unstructured":"Lee C, Lee K, Park S (2013) Benders decomposition approach for the robust network design problem with flow bifurcations. Networks 62(1):1\u201316","journal-title":"Networks"},{"issue":"6","key":"3443_CR19","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/j.orl.2012.09.009","volume":"40","author":"S Mattia","year":"2012","unstructured":"Mattia S (2012) Separating tight metric inequalities by bilevel programming. Oper Res Lett 40(6):568\u2013572","journal-title":"Oper Res Lett"},{"issue":"2","key":"3443_CR20","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/s10589-010-9364-0","volume":"51","author":"S Mattia","year":"2012","unstructured":"Mattia S (2012) Solving survivable two-layer network design problems by metric inequalities. Comput Optim Appl 51(2):809\u2013834","journal-title":"Comput Optim Appl"},{"issue":"1","key":"3443_CR21","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1002\/net.21488","volume":"62","author":"S Mattia","year":"2013","unstructured":"Mattia S (2013) A polyhedral study of the capacity formulation of the multilayer network design problem. Networks 62(1):17\u201326","journal-title":"Networks"},{"issue":"3","key":"3443_CR22","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s10589-012-9500-0","volume":"54","author":"S Mattia","year":"2013","unstructured":"Mattia S (2013) The robust network loading problem with dynamic routing. Comput Optim Appl 54(3):619\u2013643","journal-title":"Comput Optim Appl"},{"key":"3443_CR23","doi-asserted-by":"crossref","unstructured":"Mattia S (2016) Benders decomposition for capacitated network design. In: Proceedings of ISCO 2016, vol 9849 of LNCS, pp 71\u201380","DOI":"10.1007\/978-3-319-45587-7_7"},{"key":"3443_CR24","doi-asserted-by":"crossref","unstructured":"Mattia S (2017) A polyhedral study of the robust capacitated edge activation problem. In: Proceedings of ODS 2017, vol 217 of PROMS, pp 413\u2013419","DOI":"10.1007\/978-3-319-67308-0_42"},{"key":"3443_CR25","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1002\/net.21797","volume":"71","author":"S Mattia","year":"2018","unstructured":"Mattia S (2018) The capacity formulation of the capacitated edge activation problem. Networks 71:381\u2013402","journal-title":"Networks"},{"key":"3443_CR26","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1007\/s10589-017-9956-z","volume":"69","author":"S Mattia","year":"2018","unstructured":"Mattia S, Poss M (2018) A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation. Comput Optim Appl 69:753\u2013800","journal-title":"Comput Optim Appl"},{"issue":"4","key":"3443_CR27","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/TCT.1971.1083312","volume":"18","author":"K Onaga","year":"1971","unstructured":"Onaga K, Kakusho O (1971) On feasibility conditions of multicommodity flows in network. IEEE Trans Circ Theory 18(4):425\u2013429","journal-title":"IEEE Trans Circ Theory"},{"issue":"3","key":"3443_CR28","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1016\/j.cor.2008.09.003","volume":"37","author":"I Rodr\u00edguez-Martin","year":"2010","unstructured":"Rodr\u00edguez-Martin I, Salazar-Gonz\u00e1lez J-J (2010) A local branching heuristic for the capacitated fixed-charge network design problem. Comput Oper Res 37(3):575\u2013581","journal-title":"Comput Oper Res"},{"issue":"1","key":"3443_CR29","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s002110050054","volume":"68","author":"M Stoer","year":"1994","unstructured":"Stoer M, Dahl G (1994) A polyhedral approach to multicommodity survivable network design. Numer Math 68(1):149\u2013167","journal-title":"Numer Math"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3443-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3443-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3443-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T19:10:24Z","timestamp":1567019424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3443-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,29]]},"references-count":29,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["3443"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3443-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2018,8,29]]},"assertion":[{"value":"29 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The author has no conflict of interest concerning this study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed the author.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal participants"}}]}}