{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T17:29:26Z","timestamp":1768584566867,"version":"3.49.0"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Italian Ministry for Instruction, University and Research under the PON VASARI Project","award":["ARS01_00456"],"award-info":[{"award-number":["ARS01_00456"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2986535","type":"journal-article","created":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T21:18:16Z","timestamp":1586380696000},"page":"68983-69002","source":"Crossref","is-referenced-by-count":9,"title":["Optimal Assignment Plan in Sliced Backhaul Networks"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3608-8142","authenticated-orcid":false,"given":"Christian","family":"Quadri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Premoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Ceselli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabrina","family":"Gaito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gian Paolo","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"64","article-title":"Column generation for linear and integer programming","volume":"20","author":"nemhauser","year":"2012","journal-title":"Optim Stories"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/b135457"},{"key":"ref31","year":"2019","journal-title":"IBM Optimizer Webpage"},{"key":"ref30","author":"ahuja","year":"1993","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2623950"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.23919\/IFIPNetworking.2018.8696508"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0103183"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TBC.2019.2901406"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/NETSOFT.2016.7502415"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CNSM.2015.7367390"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2815441"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2895378"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2881964"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.02.022"},{"key":"ref16","year":"2018","journal-title":"Telecommunication Management Study on Management and Orchestration of Network Slicing for Next Generation Network"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.09.001"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3241539.3241567"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2016.2598420"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2867550"},{"key":"ref4","year":"2019","journal-title":"OSM Release FIVE Technical Overview"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2015.7018201"},{"key":"ref3","year":"2013"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2016.2597295"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","author":"conforti","year":"2014","journal-title":"Integer Programming"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2019.106984"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2019.2905599"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2491361"},{"key":"ref2","year":"2019"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2018.2876623"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2018.09.005"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2682318"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2705720"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2771153"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2828102"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2012.090512.00043"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2834623"},{"key":"ref25","year":"2018","journal-title":"Policy and Charging Control Architecture"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09060955.pdf?arnumber=9060955","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T18:27:40Z","timestamp":1696012060000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9060955\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2986535","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}