{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:44:28Z","timestamp":1730209468685,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T00:00:00Z","timestamp":1593388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T00:00:00Z","timestamp":1593388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T00:00:00Z","timestamp":1593388800000},"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":[[2020,6,29]]},"DOI":"10.1109\/codit49905.2020.9263884","type":"proceedings-article","created":{"date-parts":[[2020,11,27]],"date-time":"2020-11-27T20:37:38Z","timestamp":1606509458000},"page":"1127-1132","source":"Crossref","is-referenced-by-count":1,"title":["Exact and Heuristic Solutions to the Connected k-Partitioning Problem"],"prefix":"10.1109","author":[{"given":"Patrick","family":"Healy","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Laroche","sequence":"additional","affiliation":[]},{"given":"Franc","family":"Marchetti","sequence":"additional","affiliation":[]},{"given":"Sebastien","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Zsuzsanna","family":"Roka","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1016\/j.orl.2006.04.001"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1080\/1055678021000090033"},{"key":"ref12","first-page":"1","article-title":"I mproved Approximation Algorithms for MAX k-CUT and MAX BISECTION, in Integer Programming and Combinatorial Optimization","volume":"920","author":"frieze","year":"0","journal-title":"IPCO 1995"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1145\/227683.227684"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1137\/0204019"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/12.67327"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref17","first-page":"211","article-title":"On Greedy Construction Heuristics for the MAX-CUT problem","volume":"3","author":"kahruman","year":"2007","journal-title":"International Journal of Computational Engineering Science"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1007\/s10732-011-9189-8"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1016\/j.ejor.2008.07.026"},{"key":"ref4","first-page":"8838","article-title":"Partitioning for Large-scale Systems: A Sequential Distributed MPC Design","volume":"50","author":"barreiro-gomez","year":"2017"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1016\/j.jprocont.2018.12.011"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1016\/S0166-218X(00)00299-7"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1007\/BF02592023"},{"key":"ref8","article-title":"Branch-and-Cut algorithm for the connected-cut problem","author":"borne","year":"2014","journal-title":"BookROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d’aide à la décision"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1007\/978-1-84628-970-5"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1007\/BF02592023"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1016\/j.dam.2016.04.002"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1023\/B:JOCO.0000038912.82046.17"},{"key":"ref20","first-page":"502","article-title":"Finding the maximum cut in a graph","volume":"10","author":"orlova","year":"1972","journal-title":"Engineering Cybernetics"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1145\/321958.321975"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1007\/s10107-008-0235-8"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/PAAP.2011.35"}],"event":{"name":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","start":{"date-parts":[[2020,6,29]]},"location":"Prague, Czech Republic","end":{"date-parts":[[2020,7,2]]}},"container-title":["2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9263400\/9263776\/09263884.pdf?arnumber=9263884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:47:30Z","timestamp":1656344850000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9263884\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,29]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/codit49905.2020.9263884","relation":{},"subject":[],"published":{"date-parts":[[2020,6,29]]}}}