{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:28:30Z","timestamp":1742916510620,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030166915"},{"type":"electronic","value":"9783030166922"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-16692-2_29","type":"book-chapter","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T19:44:24Z","timestamp":1554839064000},"page":"430-438","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Matheuristic for Green and Robust 5G Virtual Network Function Placement"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Bauschert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"D\u2019Andreagiovanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Kassler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenghao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,30]]},"reference":[{"key":"29_CR1","volume-title":"5G Networks - Planning, Design and Optimization","author":"C Larsson","year":"2018","unstructured":"Larsson, C.: 5G Networks - Planning, Design and Optimization. Academic Press, Cambridge (2018)"},{"issue":"4","key":"29_CR2","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1109\/MCOM.2016.7452271","volume":"54","author":"S Abdelwahab","year":"2016","unstructured":"Abdelwahab, S., Hamdaoui, B., Guizani, M., Znati, T.: Network function virtualization in 5G. IEEE Commun. Mag. 54(4), 84\u201391 (2016)","journal-title":"IEEE Commun. Mag."},{"issue":"3","key":"29_CR3","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1109\/TNSM.2016.2598420","volume":"13","author":"J Herrera","year":"2016","unstructured":"Herrera, J., Botero, J.: Resource allocation in NFV: a comprehensive survey. IEEE Trans. Netw. Serv. Manage. 13(3), 518\u2013532 (2016)","journal-title":"IEEE Trans. Netw. Serv. Manage."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Baumgartner, A., Bauschert, T., D\u2019Andreagiovanni, F., Reddy, V.S.: Towards robust network slice design under correlated demand uncertainties. In: IEEE International Conference on Communications (ICC), pp. 1\u20137 (2018)","DOI":"10.1109\/ICC.2018.8422618"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Luizelli, M.C., Bays, L.R., Buriol, L.S., Barcellos, M.P., Gaspary, L.P.: Piecing together the NFV provisioning puzzle: efficient placement and chaining of virtual network functions. In: IFIP\/IEEE International Symposium on Integrated Network Management (IM), pp. 98\u2013106 (2015)","DOI":"10.1109\/INM.2015.7140281"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.comnet.2017.04.045","volume":"125","author":"A Marotta","year":"2017","unstructured":"Marotta, A., D\u2019Andreagiovanni, F., Kassler, A., Zola, E.: On the energy cost of robustness for green virtual network function placement in 5G virtualized infrastructures. Comput. Netw. 125, 64\u201375 (2017)","journal-title":"Comput. Netw."},{"issue":"3","key":"29_CR7","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TNSM.2016.2598068","volume":"13","author":"M Mechtri","year":"2016","unstructured":"Mechtri, M., Ghribi, C., Zeghlache, D.: A scalable algorithm for the placement of service function chains. IEEE Trans. Netw. Serv. Manage. 13(3), 533\u2013546 (2016)","journal-title":"IEEE Trans. Netw. Serv. Manage."},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.jnca.2017.07.014","volume":"95","author":"A Marotta","year":"2017","unstructured":"Marotta, A., Zola, E., D\u2019Andreagiovanni, F., Kassler, A.: A fast robust approach for green virtual network functions deployment. J. Netw. Comput. Appl. 95, 42\u201353 (2017)","journal-title":"J. Netw. Comput. Appl."},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft. Comput. 11, 4135\u20134151 (2011)","journal-title":"Appl. Soft. Comput."},{"key":"29_CR10","doi-asserted-by":"publisher","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. Princeton University Press, Princeton (2009)"},{"key":"29_CR11","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 Commun. Mag. 52, 178\u2013185 (2014)","journal-title":"IEEE Commun. Mag."},{"issue":"1","key":"29_CR12","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":"29_CR13","unstructured":"IBM ILOG CPLEX. \n                      http:\/\/www-01.ibm.com\/software"},{"key":"29_CR14","volume-title":"Genetic Algorithms in Search, Optimization & Machine Learning","author":"D Goldberg","year":"1988","unstructured":"Goldberg, D.: Genetic Algorithms in Search, Optimization & Machine Learning. Addison-Wesley, Reading (1988)"},{"key":"29_CR15","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."}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16692-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:03:37Z","timestamp":1558343017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-16692-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030166915","9783030166922"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16692-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"30 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leipzig","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2019\/cfp_evoapps.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"MyReview","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"44","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"24","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"67% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}