{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T20:34:53Z","timestamp":1778877293927,"version":"3.51.4"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1109\/noms54207.2022.9789758","type":"proceedings-article","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T21:21:22Z","timestamp":1654809682000},"page":"1-9","source":"Crossref","is-referenced-by-count":5,"title":["Lagrangian Heuristics for Capacitated Shortest Path Tour Problem Based Online Service Chaining"],"prefix":"10.1109","author":[{"given":"Takanori","family":"Hara","sequence":"first","affiliation":[{"name":"Nara Institute of Science and Technology,Graduate School of Science and Technology,Nara,Japan,630-0192"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"Sasabe","sequence":"additional","affiliation":[{"name":"Nara Institute of Science and Technology,Graduate School of Science and Technology,Nara,Japan,630-0192"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2020.3044329"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-010-0258-y"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.04.029"},{"key":"ref13","first-page":"1","article-title":"The Shortest Path Tour Problem: Problem Definition, Modeling, and Optimization","author":"festa","year":"2009","journal-title":"Proc of INOC"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.04.002"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2018.07.019"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12782"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485996"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2934725"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.09.037"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2018.01.021"},{"key":"ref27","article-title":"IBM ILOG CPLEX Optimizer","year":"2021"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2016.2598420"},{"key":"ref6","first-page":"160","article-title":"The Price of Routing Unsplit-table Flow","volume":"42","author":"awerbuch","year":"2005","journal-title":"Proc of STOC"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.17487\/RFC7665"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3017792"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2017.8038463"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.09.001"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2017.8292517"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/MCOM.2015.7045396","article-title":"Network Function Virtualization: Challenges and Opportunities for Innovations","volume":"53","author":"han","year":"2015","journal-title":"IEEE Communications Magazine"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2833815"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2659298"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2912717"},{"key":"ref24","author":"schrijver","year":"2000","journal-title":"Theory of Linear and Integer Programming"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2672278"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.036113"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2019.2914387"}],"event":{"name":"NOMS 2022-2022 IEEE\/IFIP Network Operations and Management Symposium","location":"Budapest, Hungary","start":{"date-parts":[[2022,4,25]]},"end":{"date-parts":[[2022,4,29]]}},"container-title":["NOMS 2022-2022 IEEE\/IFIP Network Operations and Management Symposium"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9789703\/9789704\/09789758.pdf?arnumber=9789758","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T20:10:25Z","timestamp":1656965425000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9789758\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/noms54207.2022.9789758","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]}}}