{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T15:32:34Z","timestamp":1783438354516,"version":"3.54.6"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"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 (JSPS) KAKENHI, Japan","doi-asserted-by":"publisher","award":["19K11942"],"award-info":[{"award-number":["19K11942"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Serv. Manage."],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1109\/tnsm.2020.3044329","type":"journal-article","created":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T21:00:41Z","timestamp":1607979641000},"page":"104-117","source":"Crossref","is-referenced-by-count":32,"title":["Capacitated Shortest Path Tour Problem-Based Integer Linear Programming for Service Chaining and Function Placement in NFV Networks"],"prefix":"10.1109","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1200-9112","authenticated-orcid":false,"given":"Masahiro","family":"Sasabe","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7861-1771","authenticated-orcid":false,"given":"Takanori","family":"Hara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2016.2569020"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12782"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2018.1548015"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3377458.3377468"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.036113"},{"key":"ref35","year":"2020","journal-title":"Boost Graph Library"},{"key":"ref34","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-56039-6","author":"korte","year":"2018","journal-title":"Combinatorial Optimization Theory and Algorithms"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2934725"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"ref12","author":"bertsekas","year":"2000","journal-title":"Dynamic Programming and Optimal Control"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-010-0258-y"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.04.029"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2017.8038463"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761660"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.04.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2018.07.019"},{"key":"ref19","year":"2020","journal-title":"IBM ILOG CPLEX Optimizer"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2869955"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2018.01.021"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485996"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2016.2598420"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2019.102424"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2019.01.041"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.17487\/RFC7665"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2912717"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2815298"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2015.7045396"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/NetSoft48620.2020.9165364"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2833815"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2019.2914387"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2659298"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2815318"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2017.02.011"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2672278"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486275"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2019.01.036"}],"container-title":["IEEE Transactions on Network and Service Management"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4275028\/9374858\/09292664.pdf?arnumber=9292664","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,4]],"date-time":"2022-12-04T22:49:13Z","timestamp":1670194153000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9292664\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":36,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnsm.2020.3044329","relation":{},"ISSN":["1932-4537","2373-7379"],"issn-type":[{"value":"1932-4537","type":"electronic"},{"value":"2373-7379","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3]]}}}