{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T19:28:18Z","timestamp":1770492498319,"version":"3.49.0"},"reference-count":10,"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.9263846","type":"proceedings-article","created":{"date-parts":[[2020,11,27]],"date-time":"2020-11-27T20:37:38Z","timestamp":1606509458000},"page":"1150-1155","source":"Crossref","is-referenced-by-count":4,"title":["Adaptation of the Rounding Search-Based Algorithm for the k-Clustering Minimum Completion Problem"],"prefix":"10.1109","author":[{"given":"M.","family":"Hifi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Sadeghsa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18161-5_2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.01.019"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.5.2.266"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CoDIT.2016.7593637"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2012.00860.x"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18161-5_2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.26682\/sjuod.2017.20.1.16"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2007.09.005"},{"key":"ref9","first-page":"65","article-title":"Biclique completion problem: models and algorithms","author":"magni","year":"2009","journal-title":"Master Project"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2013.819096"}],"event":{"name":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","location":"Prague, Czech Republic","start":{"date-parts":[[2020,6,29]]},"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\/09263846.pdf?arnumber=9263846","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:48:36Z","timestamp":1656344916000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9263846\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,29]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/codit49905.2020.9263846","relation":{},"subject":[],"published":{"date-parts":[[2020,6,29]]}}}