{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:36:41Z","timestamp":1730209001422,"version":"3.28.0"},"reference-count":27,"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.10284108","type":"proceedings-article","created":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T17:46:12Z","timestamp":1698169572000},"page":"477-482","source":"Crossref","is-referenced-by-count":0,"title":["The Multi-Commodity Flow Problem with Disjoint Signaling Paths: A Branch-and-Benders-Cut Algorithm"],"prefix":"10.1109","author":[{"given":"Jiachen","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Toronto,Department of Mechanical and Industrial Engineering,Toronto,Ontario,Canada,M5S 3G8"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youcef","family":"Magnouche","sequence":"additional","affiliation":[{"name":"Huawei Technologies,France Research Center,Boulogne-Billancourt,France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastien","family":"Martin","sequence":"additional","affiliation":[{"name":"Huawei Technologies,France Research Center,Boulogne-Billancourt,France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Fressancourt","sequence":"additional","affiliation":[{"name":"Huawei Technologies,France Research Center,Boulogne-Billancourt,France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[{"name":"University of Toronto,Department of Mechanical and Industrial Engineering,Toronto,Ontario,Canada,M5S 3G8"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190112"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/DRCN.2009.5339995"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3080931"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.92"},{"key":"ref11","first-page":"947","article-title":"Comparison of IP-based and explicit paths for one-to-one fast reroute in MPLS networks","volume":"52","author":"hock","year":"2013","journal-title":"Telecommunication Systems"},{"key":"ref10","first-page":"611","author":"xia","year":"0","journal-title":"Primary\/secondary path generation problem Reformulation solutions and comparisons"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2014.2346085"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2943145"},{"journal-title":"IBM","article-title":"IBM ILOG CPLEX Optimizer","year":"0","key":"ref17"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646130"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2006.05.006"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386316"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref23","first-page":"65","article-title":"Branch-and-cut algorithms for combinatorial optimization problems","volume":"1","author":"mitchell","year":"2002","journal-title":"Handbook of Applied Optimization"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0365-7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1287\/moor.10.2.280"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2009.05.007"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-010-9278-2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1110.0472"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.12.005"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2020.102856"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2007.11.008"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2018.10.015"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/net.1975.5.1.45"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230080107"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2320829"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.11.004"}],"event":{"name":"2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)","start":{"date-parts":[[2023,7,3]]},"location":"Rome, Italy","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\/10284108.pdf?arnumber=10284108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T19:02:17Z","timestamp":1699902137000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10284108\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,3]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/codit58514.2023.10284108","relation":{},"subject":[],"published":{"date-parts":[[2023,7,3]]}}}