{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:29:54Z","timestamp":1758709794714,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001870","name":"Polish National Science Centre","doi-asserted-by":"publisher","award":["2016\/23\/B\/ST6\/03599"],"award-info":[{"award-number":["2016\/23\/B\/ST6\/03599"]}],"id":[{"id":"10.13039\/501100001870","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3038228","type":"journal-article","created":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T20:52:44Z","timestamp":1605559964000},"page":"207034-207043","source":"Crossref","is-referenced-by-count":1,"title":["When the Decomposition Meets the Constraint Satisfaction Problem"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0135-7450","authenticated-orcid":false,"given":"Youcef","family":"Djenouri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Djamel","family":"Djenouri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9398-7072","authenticated-orcid":false,"given":"Zineb","family":"Habbas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8768-9709","authenticated-orcid":false,"given":"Jerry Chun-Wei","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5288-0324","authenticated-orcid":false,"given":"Tomasz P.","family":"Michalak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9027-298X","authenticated-orcid":false,"given":"Alberto","family":"Cano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.05.056"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2018.02.005"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190070"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2016.2596098"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms12996"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/69.729707"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-012-9121-3"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1504\/IJCSE.2005.009703"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-015-9292-3"},{"key":"ref10","first-page":"1","article-title":"Exploiting tree decomposition and soft local consistency in weighted CSP","volume":"6","author":"de givry","year":"2006","journal-title":"Proc AAAI"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2017.3121546"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2956-1"},{"key":"ref13","first-page":"293","article-title":"Coalition structure generation with the graphics processing unit","author":"paw?owski","year":"2014","journal-title":"Proc AAMAS"},{"key":"ref14","first-page":"2677","article-title":"A MaxSAT algorithm using cardinality constraints of bounded size","author":"alviano","year":"2015","journal-title":"Proc IJCAI"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2897703"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-01664-w"},{"key":"ref17","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","volume":"1","author":"macqueen","year":"1967","journal-title":"Proc 5th Berkeley Symp Math Statist Probab"},{"key":"ref18","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"ester","year":"1996","journal-title":"Proc KDD"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/321033.321034"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.08.245"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1203-5"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2742359"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.08.033"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.03.033"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2013.81"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.08.039"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-012-0338-z"},{"key":"ref7","first-page":"32","article-title":"Algorithms for constraint-satisfaction problems: A survey","volume":"13","author":"kumar","year":"1992","journal-title":"AI Mag"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/16M109003X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-017-1094-x"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/34.57681"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2811255"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2018.09.013"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-015-9198-6"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00078-3"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(89)90037-4"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902309"},{"article-title":"Understanding tractable decompositions for constraint satisfaction","year":"2008","author":"mikl\u00f3s","key":"ref25"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09260140.pdf?arnumber=9260140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:56:56Z","timestamp":1642003016000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9260140\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3038228","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}