{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T04:31:10Z","timestamp":1768537870721,"version":"3.49.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T00:00:00Z","timestamp":1688342400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T00:00:00Z","timestamp":1688342400000},"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":[[2023,7,3]]},"DOI":"10.1109\/codit58514.2023.10284337","type":"proceedings-article","created":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T13:46:12Z","timestamp":1698155172000},"page":"488-493","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Admission Control in Damper-Based Networks: Branch-and-Price Algorithm"],"prefix":"10.1109","author":[{"given":"M. Yassine","family":"Naghmouchi","sequence":"first","affiliation":[{"name":"Paris Research Center,Huawei Technologies,France"}]},{"given":"Shoushou","family":"Ren","sequence":"additional","affiliation":[{"name":"Beijing Research Center,Huawei Technologies,China"}]},{"given":"Paolo","family":"Medagliani","sequence":"additional","affiliation":[{"name":"Paris Research Center,Huawei Technologies,France"}]},{"given":"S\u00e9bastien","family":"Martin","sequence":"additional","affiliation":[{"name":"Paris Research Center,Huawei Technologies,France"}]},{"given":"J\u00e9r\u00e9mie","family":"Leguay","sequence":"additional","affiliation":[{"name":"Paris Research Center,Huawei Technologies,France"}]}],"member":"263","reference":[{"key":"ref13","article-title":"Flows in networks","author":"ford","year":"2015","journal-title":"Flows in Networks"},{"key":"ref24","first-page":"58","article-title":"Integer multicommodity flow problems","author":"barnhart","year":"0","journal-title":"Proc Conference on Integer Programming and Combinatorial Optimization"},{"key":"ref12","author":"le boudec","year":"2001","journal-title":"Network Calculus A Theory of Determin-istic Queuing Systems for the Internet"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2014.0582"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230080107"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/inte.28.2.32"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2020.10.016"},{"key":"ref11","first-page":"1","article-title":"Constrained shortest path problems: state-of-the-art and re-cent advances","author":"festa","year":"0","journal-title":"Transparent Optical Networks (ICTON) 2015 17th International Conference on IEEE"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-020-00564-8"},{"key":"ref10","author":"alvelos","year":"2005","journal-title":"Branch-and-price and multicommodity flows"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30165-5_10"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2841349"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.23919\/CNSM55787.2022.9964638"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2005.06.004"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.06.038"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.46.1.126.15132"},{"key":"ref18","first-page":"167","article-title":"Allocating resources to support a multicommodity flow with time windows","volume":"28","author":"rathi","year":"1992","journal-title":"The Logistics and Transportation Review"},{"key":"ref8","article-title":"Column generation","volume":"5","author":"desaulniers","year":"2006","journal-title":"Springer Science & Business Media"},{"key":"ref7","first-page":"7","article-title":"Comparing branch-and-price algorithms for the unsplittable multicommodity flow problem","author":"alvelos","year":"0","journal-title":"International Network Optimization Conference"},{"key":"ref9","year":"0","journal-title":"CPLEX"},{"key":"ref4","article-title":"Deterministic networking architecture","year":"2019","journal-title":"RFC 8655"},{"key":"ref3","article-title":"Cyclic queuing and forwarding for large scale deterministic networks: A survey","volume":"abs 1905 8478","author":"nasrallah","year":"2019","journal-title":"ArXiv"},{"key":"ref6","author":"grigorjew","year":"2020","journal-title":"asynchronous traffic shaping with jitter control"},{"key":"ref5","article-title":"Large-scale deterministic ip network","author":"qiang","year":"2019","journal-title":"Internet Engineering Task Force Internet-Draft draft-qiang-detnet-large-scale-detnet-04"}],"event":{"name":"2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)","location":"Rome, Italy","start":{"date-parts":[[2023,7,3]]},"end":{"date-parts":[[2023,7,6]]}},"container-title":["2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10284032\/10284045\/10284337.pdf?arnumber=10284337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T13:59:17Z","timestamp":1700488757000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10284337\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,3]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/codit58514.2023.10284337","relation":{},"subject":[],"published":{"date-parts":[[2023,7,3]]}}}