{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T17:08:48Z","timestamp":1725988128999},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319071237"},{"type":"electronic","value":"9783319071244"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-07124-4_46","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T19:09:59Z","timestamp":1534187399000},"page":"1123-1140","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Network Optimization"],"prefix":"10.1007","author":[{"given":"Luciana S.","family":"Buriol","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"46_CR1","unstructured":"Ahuja RK, Orlin JB, Magnanti TL (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, Upper Saddle River"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Alkmim G, Batista D, da Fonseca N (2013) Mapping virtual networks onto substrate networks. J Internet Serv Appl 4:1\u201315","DOI":"10.1186\/1869-0238-4-3"},{"key":"46_CR3","unstructured":"Bays L, Oliveira R, Buriol L, Barcellos M, Gaspary L (2012) Security-aware optimal resource allocation for virtual network embedding. In: Network and service management (CNSM), pp 378\u2013384"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Bays L, Oliveira R, Buriol L, Barcellos M, Gaspary L (2014) A heuristic-based algorithm for privacy-oriented virtual network embedding. In: 14th IEEE\/IFIP network operations and management symposium (NOMS 2014), pp 1\u20138","DOI":"10.1109\/NOMS.2014.6838360"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Bley A (2011) An integer programming algorithm for routing optimization in ip networks. Algorithmica 60(1):21\u201345","DOI":"10.1007\/s00453-009-9381-5"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Botero J, Hesselbach X, Duelli M, Schlosser D, Fischer A, de Meer H (2012) Energy efficient virtual network embedding. IEEE Commun Lett 16(5):756\u2013759","DOI":"10.1109\/LCOMM.2012.030912.120082"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Brostr\u00f6m P, Holmberg K (2006) Multiobjective design of survivable IP networks. Ann Oper Res 147:235\u2013253","DOI":"10.1007\/s10479-006-0067-y"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Buriol L, Resende M, Ribeiro C, Thorup M (2005) A hybrid genetic algorithm for the weight setting problem in OSPF\/IS-IS routing. Networks 46:36\u201356","DOI":"10.1002\/net.20070"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"Buriol L, Resende M, Ribeiro C, Thorup M (2005) A hybrid genetic algorithm for the weight setting problem in OSPF\/IS-IS routing. Networks 46(1):36\u201356","DOI":"10.1002\/net.20070"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Buriol L, Resende M, Thorup M (2007) Survivable IP network desing with OSPF routing. Networks 49(1):51\u201364","DOI":"10.1002\/net.20141"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Buriol L, Resende M, Thorup M (2008) Speeding up dynamic shortest-path algorithms. INFORMS J Comput 20:191\u2013204","DOI":"10.1287\/ijoc.1070.0231"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Cao W, Wang H, Liu L (2014) An ant colony optimization algorithm for virtual network embedding. In: Algorithms and architectures for parallel processing. Lecture notes in computer science, vol 8630, pp 299\u2013309","DOI":"10.1007\/978-3-319-11197-1_23"},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"Chowdhury N, Boutaba R (2010) A survey of network virtualization. Comput Netw 54(5):862\u2013876","DOI":"10.1016\/j.comnet.2009.10.017"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"Chowdhury NMMK, Rahman MR, Boutaba R (2009) Virtual network embedding with coordinated node and link mapping. In: INFOCOM. IEEE, pp 783\u2013791","DOI":"10.1109\/INFCOM.2009.5061987"},{"key":"46_CR15","doi-asserted-by":"crossref","unstructured":"Chowdhury M, Rahman M, Boutaba R (2012) ViNEYard: virtual network embedding algorithms with coordinated node and link mapping. IEEE\/ACM Trans Netw 20(1):206\u2013219","DOI":"10.1109\/TNET.2011.2159308"},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"Ericsson M, Resende M, Pardalos P (2002) A genetic algorithm for the weight setting problem in OSPF routing. J Comb Optim 6:299\u2013333","DOI":"10.1023\/A:1014852026591"},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"Even S, Itai A, Shamir A (1976) On the complexity of timetable and multicommodity flow problems. SIAM J Comput 5:691\u2013703","DOI":"10.1137\/0205048"},{"key":"46_CR18","doi-asserted-by":"crossref","unstructured":"Fajjari I, Aitsaadi N, Pujolle G, Zimmermann H (2011) Vne-ac: virtual network embedding algorithm based on ant colony metaheuristic. In: IEEE international conference on communications (ICC), pp 1\u20136","DOI":"10.1109\/icc.2011.5963442"},{"key":"46_CR19","doi-asserted-by":"crossref","unstructured":"Feamster N, Gao L, Rexford J (2007) How to lease the internet in your spare time. SIGCOMM Comput Commun Rev 37(1):61\u201364","DOI":"10.1145\/1198255.1198265"},{"key":"46_CR20","doi-asserted-by":"crossref","unstructured":"Fortz B, Thorup M (2000) Internet traffic engineering by optimizing OSPF weights. In: INFOCOM, pp 519\u2013528","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"46_CR21","doi-asserted-by":"crossref","unstructured":"Fortz B, Thorup M (2004) Increasing internet capacity using local search. Comput Optim Appl 29(1):13\u201348","DOI":"10.1023\/B:COAP.0000039487.35027.02"},{"key":"46_CR22","doi-asserted-by":"crossref","unstructured":"Goldberg A, Tarjan R (1988) A new approach to the maximum-flow problem. J ACM 35:921\u2013940","DOI":"10.1145\/48014.61051"},{"key":"46_CR23","doi-asserted-by":"crossref","unstructured":"Goldberg A, Kaplan H, Werneck R (2007) Better landmarks within reach. In: Workshop on experimental algorithms, pp 38\u201351","DOI":"10.1007\/978-3-540-72845-0_4"},{"key":"46_CR24","doi-asserted-by":"crossref","unstructured":"Guerzoni R, Trivisonno R, Vaishnavi I, Despotovic Z, Hecker A, Beker S, Soldani D (2014) A novel approach to virtual networks embedding for SDN management and orchestration. In: Network operations and management symposium (NOMS 2014). IEEE, pp 1\u20137","DOI":"10.1109\/NOMS.2014.6838244"},{"key":"46_CR25","unstructured":"Hoffman A, Kruskal J (1956) Integral boundary points of convex polyhedra. Ann Math Stud 38:223\u2013246"},{"key":"46_CR26","doi-asserted-by":"crossref","unstructured":"Houidi I, Louati W, Ameur W, Zeghlache D (2011) Virtual network provisioning across multiple substrate networks. Comput Netw 55(4):1011\u20131023","DOI":"10.1016\/j.comnet.2010.12.011"},{"key":"46_CR27","doi-asserted-by":"crossref","unstructured":"Inf\u00fchr J, Raidl G (2011) Introducing the virtual network mapping problem with delay, routing and location constraints. In: Pahl J, Reiners T, Vo\u00dfS (eds) Network optimization. Lecture notes in computer science, vol 6701. Springer, Berlin\/Heidelberg, pp 105\u2013117","DOI":"10.1007\/978-3-642-21527-8_14"},{"key":"46_CR28","unstructured":"Kleinberg J, Tardos E (2005) Algorithm design. Addison Wesley, Boston"},{"key":"46_CR29","unstructured":"K\u00f6hler E, M\u00fchring R, Schilling H (2006) Fast point-to-point shortest path computations with arc-flags. In: 9th DIMACS implementation challenge"},{"key":"46_CR30","unstructured":"Lauther U (2006) An experimental evaluation of point-to-point shortest path calculation on roadnetworks with precalculated edge-flags. In: 9th DIMACS implementation challenge"},{"key":"46_CR31","doi-asserted-by":"crossref","unstructured":"Likhachev M, Ferguson D, Gordon G, Stentz A, Thrun S (2008) Anytime search in dynamic graphs. Artif Intell 172:1613\u20131643","DOI":"10.1016\/j.artint.2007.11.009"},{"key":"46_CR32","unstructured":"Moura L (2015) Branch & price for the virtual network embedding problem. Master\u2019s thesis, Federal University of Rio Grande do Sul, Porto Alegre"},{"key":"46_CR33","doi-asserted-by":"publisher","unstructured":"Moura L, Gaspary L, Buriol LS (2017) A branch-and-price algorithm for the single-path virtual network embedding problem. Networks Online 1\u201315. https:\/\/doi.org\/10.1002\/net.21798","DOI":"10.1002\/net.21798"},{"key":"46_CR34","doi-asserted-by":"crossref","unstructured":"Orlin J (2013) Max flows in o(nm) time, or better. In: Proceedings of the forty-fifth annual ACM symposium on theory of computing, pp 765\u2013774","DOI":"10.1145\/2488608.2488705"},{"issue":"4","key":"46_CR35","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0166-5316(02)00036-6","volume":"48","author":"M Pioro","year":"2002","unstructured":"Pioro M, Szentsi A, Harmatos J, Juttner A, Gajownicczek P, Kozdrowski S (2002) On open shortest path first related network optimization problems. Perform Eval 48(4):201\u2013223","journal-title":"Perform Eval"},{"key":"46_CR36","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G Ramalingam","year":"1996","unstructured":"Ramalingam G, Reps T (1996) An incremental algorithm for a generalization of the shortest-path problem. J Algorithms 21:267\u2013305","journal-title":"J Algorithms"},{"key":"46_CR37","doi-asserted-by":"crossref","unstructured":"Shamsi J, Brockmeyer M (2008) Efficient and dependable overlay networks. In: IEEE international symposium on parallel and distributed processing (IPDPS), pp 1\u20138","DOI":"10.1109\/IPDPS.2008.4536149"},{"key":"46_CR38","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10479-015-1800-1","volume":"249","author":"F Stefanello","year":"2017","unstructured":"Stefanello F, Buriol L, Hirsch M, Pardalos P, Querido T, Resende M, Ritt M (2017) On the minimization of traffic congestion in road networks with tolls. Ann Oper Res 249:119\u2013139","journal-title":"Ann Oper Res"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T07:22:53Z","timestamp":1571728973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_46","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}