{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:24:18Z","timestamp":1725686658960},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,21]]},"DOI":"10.23919\/ifipnetworking52078.2021.9472779","type":"proceedings-article","created":{"date-parts":[[2021,7,9]],"date-time":"2021-07-09T20:09:00Z","timestamp":1625861340000},"page":"1-9","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing Effort and Risk with Network Change Deployment Planning"],"prefix":"10.23919","author":[{"given":"Carlos","family":"de Andrade","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajay","family":"Mahimkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rakesh","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiyi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andre","family":"Cire","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giritharan","family":"Rana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zihui","family":"Ge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarat","family":"Puthenpura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer","family":"Yates","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Riding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1479-4","author":"baptiste","year":"2001","journal-title":"Constraint-Based Scheduling"},{"journal-title":"Modeling and Programming with Gecode","year":"2019","author":"schulte","key":"ref11"},{"key":"ref12","article-title":"Or-tools","author":"perron","year":"0","journal-title":"Google"},{"journal-title":"Cbc COIN-OR branch and cut","year":"2021","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78985-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626298"},{"journal-title":"Online algorithms versus off-line algorithms How much is it worth to know the future?","year":"1992","author":"karp","key":"ref16"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1145\/2034574.2034812","article-title":"Frenetic: A network programming language","author":"foster","year":"2011","journal-title":"ACM SIGPLAN ICFP"},{"key":"ref18","first-page":"1","article-title":"Composing software-defined networks","author":"monsanto","year":"2013","journal-title":"USENIX NSDI"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674992"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535382"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-018-2757-7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2079296.2079309"},{"journal-title":"Siad - smart integrated access device","year":"0","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0263-2373(00)00074-8"},{"journal-title":"MiniZinc - a free and open constraint modeling language","year":"0","key":"ref8"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","author":"conforti","year":"2014","journal-title":"Integer Programming"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851219"},{"journal-title":"Scheduling Theory Algorithms and Systems","year":"2008","author":"pinedo","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3005745.3005767"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626307"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2017.8117537"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2015.04.009"},{"key":"ref24","article-title":"Check before you change: Preventing correlated failures in service updates","author":"zhai","year":"0","journal-title":"USENIX NSDI"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359664"},{"key":"ref26","article-title":"Integer programming for the generalized high school timetabling problem","author":"kristiansen","year":"2014","journal-title":"Journal of Scheduling"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93031-2_10"}],"event":{"name":"2021 IFIP Networking Conference (IFIP Networking)","start":{"date-parts":[[2021,6,21]]},"location":"Espoo and Helsinki, Finland","end":{"date-parts":[[2021,6,24]]}},"container-title":["2021 IFIP Networking Conference (IFIP Networking)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9472750\/9472195\/09472779.pdf?arnumber=9472779","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,5]],"date-time":"2023-11-05T21:44:41Z","timestamp":1699220681000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9472779\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,21]]},"references-count":27,"URL":"https:\/\/doi.org\/10.23919\/ifipnetworking52078.2021.9472779","relation":{},"subject":[],"published":{"date-parts":[[2021,6,21]]}}}