{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:07Z","timestamp":1740169087649,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2412018JC009"],"award-info":[{"award-number":["2412018JC009"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100010211","name":"Education Department of Jilin Province","doi-asserted-by":"publisher","award":["JJKH20170911KJ"],"award-info":[{"award-number":["JJKH20170911KJ"]}],"id":[{"id":"10.13039\/501100010211","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007847","name":"Natural Science Foundation of Jilin Province","doi-asserted-by":"publisher","award":["20180101043JC"],"award-info":[{"award-number":["20180101043JC"]}],"id":[{"id":"10.13039\/100007847","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004032","name":"Jilin University","doi-asserted-by":"publisher","award":["93K172017K06"],"award-info":[{"award-number":["93K172017K06"]}],"id":[{"id":"10.13039\/501100004032","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2859618","type":"journal-article","created":{"date-parts":[[2018,7,25]],"date-time":"2018-07-25T18:49:31Z","timestamp":1532544571000},"page":"42750-42756","source":"Crossref","is-referenced-by-count":4,"title":["A Novel Strategy of Combining Variable Ordering Heuristics for Constraint Satisfaction Problems"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2664-4117","authenticated-orcid":false,"given":"Hongbo","family":"Li","sequence":"first","affiliation":[]},{"given":"Zhanshan","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","first-page":"343","article-title":"2-way vs. D-way branching for CSP","author":"hwang","year":"2005","journal-title":"Proc Princ Pract Constraint Program"},{"key":"ref32","first-page":"167","article-title":"Explanation-based weighted degree","author":"hebrard","year":"2017","journal-title":"Proc CPAIOR"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-015-9305-2"},{"key":"ref30","first-page":"431","article-title":"Boosting combinatorial search through randomization","author":"gomes","year":"1998","journal-title":"Proc AAAI"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(95)00098-4"},{"key":"ref34","first-page":"1172","article-title":"Search in a small world","author":"walsh","year":"1999","journal-title":"Proc IJCAI"},{"key":"ref10","article-title":"Online heuristic selection in constraint programming","author":"arbelaez","year":"2009","journal-title":"Proc Symp Combin Search"},{"key":"ref11","first-page":"284","article-title":"A supervised learning approach to construct hyper-heuristics for constraint satisfaction","author":"ortiz-bayliss","year":"2013","journal-title":"Proc 4th Mexican Conf Pattern Recog"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389206"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-016-9466-x"},{"key":"ref14","first-page":"1197","article-title":"Combining multiple heuristics online","author":"streeter","year":"2007","journal-title":"Proc AAAI"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-011-0309-9"},{"key":"ref16","first-page":"464","article-title":"Bandit-based search for constraint programming","author":"loth","year":"2013","journal-title":"Proc Princ Pract Constraint Program"},{"key":"ref17","first-page":"431","article-title":"Learning robust search strategies using a bandit-based approach","author":"xia","year":"2018","journal-title":"Proc AAAI"},{"journal-title":"Choco3 Documentation TASC INRIA Rennes LINA CNRS UMR 6241 COSLING S A S","year":"2016","author":"prud\u2019homme","key":"ref18"},{"journal-title":"Modeling and Programming with Gecode","year":"2018","author":"schulte","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2690672"},{"key":"ref4","first-page":"146","article-title":"Boosting systematic search by weighting constraints","volume":"16","author":"boussemart","year":"2004","journal-title":"Proc ECAI"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"1629","DOI":"10.1609\/aaai.v27i1.8519","article-title":"Making simple tabular reductionworks on negative table constraints","author":"li","year":"2013","journal-title":"Proc AAAI"},{"key":"ref3","first-page":"61","article-title":"MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems","author":"bessi\u00e8re","year":"1996","journal-title":"Proc Princ Pract Constraint Program"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1613\/jair.3463","article-title":"Counting-based search: Branching heuristics for constraint satisfaction problems","volume":"43","author":"pesant","year":"2012","journal-title":"J Artif Intell Res"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-3015-7"},{"key":"ref5","first-page":"557","article-title":"Impact-based search strategies for constraint programming","author":"refalo","year":"2004","journal-title":"Proc Princ Pract Constraint Program"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"ref7","first-page":"228","article-title":"Activity-based search for black-box constraint programming solvers","author":"michel","year":"2012","journal-title":"Proc CPAIOR"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90068-X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2013.71"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(80)90051-X"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00081-3"},{"key":"ref22","volume":"12","author":"miettinen","year":"2012","journal-title":"Nonlinear Multiobjective Optimization"},{"key":"ref21","first-page":"232","article-title":"A multicore tool for constraint solving","author":"amadini","year":"2015","journal-title":"Proc IJCAI"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49481-2_12"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-011-9107-6"},{"key":"ref25","first-page":"125","article-title":"A study of residual supports in arc consistency","author":"lecoutre","year":"2007","journal-title":"Proc IJCAI"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08419686.pdf?arnumber=8419686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T05:28:51Z","timestamp":1661664531000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8419686\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2859618","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}