{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T17:40:51Z","timestamp":1732038051633},"reference-count":27,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1016\/j.ejor.2018.12.037","type":"journal-article","created":{"date-parts":[[2018,12,25]],"date-time":"2018-12-25T14:30:18Z","timestamp":1545748218000},"page":"28-39","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines"],"prefix":"10.1016","volume":"276","author":[{"given":"Guanglei","family":"Wang","sequence":"first","affiliation":[]},{"given":"Walid","family":"Ben-Ameur","sequence":"additional","affiliation":[]},{"given":"Adam","family":"Ouorou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2018.12.037_bib0001","series-title":"Proceedings of the INOC 2015 seventh international network optimization conference","first-page":"213","article-title":"On the computational complexity of the virtual network embedding problem","volume":"vol.\u00a052","author":"Amaldi","year":"2016"},{"issue":"5","key":"10.1016\/j.ejor.2018.12.037_bib0002","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.orl.2017.06.008","article-title":"Convex and concave envelopes: revisited and new perspectives","volume":"45","author":"Ben-Ameur","year":"2017","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.ejor.2018.12.037_bib0003","series-title":"Numerical optimization: Theoretical and practical aspects","author":"Bonnans","year":"2006"},{"issue":"2","key":"10.1016\/j.ejor.2018.12.037_bib0004","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.sorms.2012.08.001","article-title":"Non-convex mixed-integer nonlinear programming: A survey","volume":"17","author":"Burer","year":"2012","journal-title":"Surveys in Operations Research and Management Science"},{"key":"10.1016\/j.ejor.2018.12.037_bib0005","series-title":"Mixed integer nonlinear programming","first-page":"373","article-title":"The milp road to miqcp","author":"Burer","year":"2012"},{"issue":"3","key":"10.1016\/j.ejor.2018.12.037_bib0006","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1007\/s10922-016-9376-x","article-title":"Data uncertainty in virtual network embedding: robust optimization and protection levels","volume":"24","author":"Coniglio","year":"2016","journal-title":"Journal of Network and Systems Management"},{"issue":"4","key":"10.1016\/j.ejor.2018.12.037_bib0007","doi-asserted-by":"crossref","first-page":"1888","DOI":"10.1109\/SURV.2013.013013.00155","article-title":"Virtual network embedding: A survey","volume":"15","author":"Fischer","year":"2013","journal-title":"IEEE Communications Surveys & Tutorials"},{"issue":"1-3","key":"10.1016\/j.ejor.2018.12.037_bib0008","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","article-title":"Local branching","volume":"98","author":"Fischetti","year":"2003","journal-title":"Mathematical programming"},{"key":"10.1016\/j.ejor.2018.12.037_bib0009","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.disopt.2017.05.004","article-title":"Virtual machine placement for minimizing connection cost in data center networks","volume":"26","author":"Fukunaga","year":"2017","journal-title":"Discrete Optimization"},{"key":"10.1016\/j.ejor.2018.12.037_bib0010","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangean relaxation for integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Mathematical Programming Study"},{"issue":"2","key":"10.1016\/j.ejor.2018.12.037_bib0011","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02592954","article-title":"Lagrangean decomposition: A model yielding stronger lagrangean bounds","volume":"39","author":"Guignard","year":"1987","journal-title":"Mathematical programming"},{"issue":"4","key":"10.1016\/j.ejor.2018.12.037_bib0012","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/j.comnet.2010.12.011","article-title":"Virtual network provisioning across multiple substrate networks","volume":"55","author":"Houidi","year":"2011","journal-title":"Computer Networks"},{"issue":"3","key":"10.1016\/j.ejor.2018.12.037_bib0013","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1093\/comjnl\/bxu154","article-title":"Exact multi-objective virtual network embedding in cloud environments","volume":"58","author":"Houidi","year":"2015","journal-title":"The Computer Journal"},{"key":"10.1016\/j.ejor.2018.12.037_bib0014","series-title":"Proceedings of the fifteenth international conference on world wide web, WWW \u201906","first-page":"595","article-title":"Dynamic placement for clustered web applications","author":"Karve","year":"2006"},{"key":"10.1016\/j.ejor.2018.12.037_sbref0015","series-title":"Computational combinatorial optimization","first-page":"112","article-title":"Lagrangian relaxation","volume":"vol. 2241","author":"Lemar\u00e9chal","year":"2001"},{"issue":"3","key":"10.1016\/j.ejor.2018.12.037_bib0016","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/PL00011429","article-title":"A geometric study of duality gaps, with applications","volume":"90","author":"Lemar\u00e9chal","year":"2001","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/j.ejor.2018.12.037_bib0017","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","article-title":"Computability of global solutions to factorable nonconvex programs: Part i-convex underestimating problems","volume":"10","author":"McCormick","year":"1976","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2018.12.037_bib0018","series-title":"Virtual networked infrastructure provisioning in distributed cloud environments","author":"Mechtri","year":"2014"},{"key":"10.1016\/j.ejor.2018.12.037_bib0019","series-title":"INFOCOM, 2010 proceedings IEEE","first-page":"1","article-title":"Improving the scalability of data center networks with traffic-aware virtual machine placement","author":"Meng","year":"2010"},{"issue":"1","key":"10.1016\/j.ejor.2018.12.037_bib0020","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/COMST.2015.2477041","article-title":"Network function virtualization: state-of-the-art and research challenges","volume":"18","author":"Mijumbi","year":"2016","journal-title":"IEEE Communications Surveys & Tutorials"},{"key":"10.1016\/j.ejor.2018.12.037_bib0021","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10479-016-2203-7","article-title":"Machine reassignment problem: the roadef\/euro challenge 2012","volume":"242","author":"Murat Afsar","year":"2016","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2018.12.037_sbref0022","series-title":"Proceedings of the third international network optimization conference (INOC 2007)","article-title":"SNDlib 1.0\u2013survivable Network Design Library","author":"Orlowski","year":"2007"},{"key":"10.1016\/j.ejor.2018.12.037_bib0023","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1109\/TC.2013.31","article-title":"On the optimal allocation of virtual resources in cloud computing networks","volume":"62","author":"Papagianni","year":"2013","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/j.ejor.2018.12.037_bib0024","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579324","article-title":"Randomized rounding: A technique for provably good algorithms and algorithmic proofs","volume":"7","author":"Raghavan","year":"1987","journal-title":"Combinatorica"},{"issue":"3","key":"10.1016\/j.ejor.2018.12.037_bib0025","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","article-title":"A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems","volume":"3","author":"Sherali","year":"1990","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/j.ejor.2018.12.037_bib0026","series-title":"Relaxations in mixed-integer quadratically constrained programming and robust programming","author":"Wang","year":"2016"},{"key":"10.1016\/j.ejor.2018.12.037_bib0027","series-title":"Proceedings of the INOC 2015 seventh international network optimization conference","first-page":"93","article-title":"Optimal mapping of cloud virtual machines","volume":"vol.\u00a052","author":"Wang","year":"2016"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221718311111?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221718311111?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T03:10:05Z","timestamp":1550805005000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221718311111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["S0377221718311111"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2018.12.037","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2019,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2018.12.037","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}