{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T08:40:36Z","timestamp":1725784836408},"reference-count":23,"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.10284215","type":"proceedings-article","created":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T17:46:12Z","timestamp":1698169572000},"page":"926-931","source":"Crossref","is-referenced-by-count":1,"title":["Unsplittable Shortest Path Routing: Extended Model and Matheuristic"],"prefix":"10.1109","author":[{"given":"Amal","family":"Benhamiche","sequence":"first","affiliation":[{"name":"Orange Labs,Châtillon,France,92320"}]},{"given":"Morgan","family":"Chopin","sequence":"additional","affiliation":[{"name":"Orange Labs,Châtillon,France,92320"}]},{"given":"S\u00e9bastien","family":"Martin","sequence":"additional","affiliation":[{"name":"Huawei Technologies & co.,Boulogne Billancourt,France"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-012-1270-7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2010.00776.x"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2023.01.008"},{"key":"ref15","article-title":"Avoiding ties in shortest path first routing","author":"thorup","year":"2003","journal-title":"Technical report Shannon Laboratory AT&T Labs"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2005.06.010"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cja.2017.05.012"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9381-5"},{"journal-title":"Network Flows Theory Algorithms and Application","year":"1993","author":"ahuja","key":"ref22"},{"key":"ref10","first-page":"199","author":"bley","year":"2010","journal-title":"Optimization of OSPF Routing in IP Networks"},{"key":"ref21","first-page":"185","author":"wolsey","year":"1998","journal-title":"Column Generation Algorithms"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2328"},{"key":"ref1","article-title":"Wide Area Network Design: Concepts and Tools for Optimization","author":"cahn","year":"1998","journal-title":"Networking"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-86514-6_30"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/net.20070"},{"key":"ref19","article-title":"Toward Scalable Algorithms for the Unsplittable Shortest Path Routing Problem","author":"benhamiche","year":"2020","journal-title":"CoRR vol abs\/2006 04324"},{"journal-title":"AAAI 2023","article-title":"Warm-Starting Nested Rollout Policy Adaptation with Optimal Stopping","year":"0","key":"ref18"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480100377428"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/net.20303"},{"key":"ref9","article-title":"An integer programming approach to the OSPF weight setting problem","author":"parmar","year":"2006","journal-title":"Technical Report School of Industrial & Systems Engineering Georgia Tech"},{"key":"ref4","article-title":"Multipath Issues in Unicast and Multicast Next-Hop Selection","author":"hopps","year":"2000","journal-title":"RFC 2991"},{"key":"ref3","article-title":"OSPF for IPv6","author":"ferguson","year":"2008","journal-title":"RFC 5340"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1023\/B:COAP.0000039487.35027.02"},{"key":"ref5","article-title":"Design of broadband virtual private networks: Model and heuristics for the B-WiN","author":"bley","year":"1998","journal-title":"Robust Communication Networks Interconnection and Survivability"}],"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\/10284215.pdf?arnumber=10284215","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T19:03:30Z","timestamp":1699902210000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10284215\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,3]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/codit58514.2023.10284215","relation":{},"subject":[],"published":{"date-parts":[[2023,7,3]]}}}