{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T10:47:23Z","timestamp":1730285243838,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/netsoft48620.2020.9165364","type":"proceedings-article","created":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T17:29:37Z","timestamp":1597253377000},"page":"114-121","source":"Crossref","is-referenced-by-count":5,"title":["Shortest Path Tour Problem Based Integer Linear Programming for Service Chaining in NFV Networks"],"prefix":"10.1109","author":[{"given":"Masahiro","family":"Sasabe","sequence":"first","affiliation":[]},{"given":"Takanori","family":"Hara","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/NFV-SDN.2015.7387426"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2815318"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2934725"},{"journal-title":"IBM ILOG CPLEX Optimizer","year":"0","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2659298"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2672278"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.04.029"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.04.002"},{"key":"ref18","article-title":"An Efficient Exact Approach for the Constrained Shortest Path Tour Problem","author":"ferone","year":"2019","journal-title":"Optimization Methods and Software"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.036113"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2017.8038463"},{"journal-title":"Dynamic Programming and Optimal Control","year":"2000","author":"bertsekas","key":"ref3"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.endm.2018.07.019","article-title":"An Integer Linear Programming Model for the Constrained Shortest Path Tour Problem","volume":"69","author":"derade","year":"2018","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761660"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2833815"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2912717"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2018.01.021"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2016.2598420"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2815298"},{"journal-title":"Deterministic time","year":"0","key":"ref20"}],"event":{"name":"2020 6th IEEE International Conference on Network Softwarization (NetSoft)","start":{"date-parts":[[2020,6,29]]},"location":"Ghent, Belgium","end":{"date-parts":[[2020,7,3]]}},"container-title":["2020 6th IEEE Conference on Network Softwarization (NetSoft)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9158198\/9165305\/09165364.pdf?arnumber=9165364","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T17:53:09Z","timestamp":1656438789000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9165364\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/netsoft48620.2020.9165364","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}