{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:09:12Z","timestamp":1746331752228,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T00:00:00Z","timestamp":1579564800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T00:00:00Z","timestamp":1579564800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61802056"],"award-info":[{"award-number":["61802056"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972063"],"award-info":[{"award-number":["61972063"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2412018ZD017"],"award-info":[{"award-number":["2412018ZD017"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Support of High-Quality Papers of Northeast Normal University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10732-019-09434-9","type":"journal-article","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T15:02:44Z","timestamp":1579618964000},"page":"453-474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On combining variable ordering heuristics for constraint satisfaction problems"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2664-4117","authenticated-orcid":false,"given":"Hongbo","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guozhong","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,21]]},"reference":[{"key":"9434_CR1","unstructured":"Amadini, R., Gabbrielli, M., Mauro, J.: A multicore tool for constraint solving. In: Proceedings of IJCAI\u201915, pp. 232\u2013238 (2015)"},{"key":"9434_CR2","doi-asserted-by":"crossref","unstructured":"Arbelaez, A., Hamadi, Y., Sebag, M.: Online heuristic selection in constraint programming (2009)","DOI":"10.1109\/ICTAI.2010.17"},{"key":"9434_CR3","doi-asserted-by":"crossref","unstructured":"Bessiere, C., R\u00e9gin, J.C.: Mac and combined heuristics: two reasons to forsake fc (and cbj?) on hard problems. In: Proceedings of CP\u201996, pp. 61\u201375. Springer (1996)","DOI":"10.1007\/3-540-61551-2_66"},{"key":"9434_CR4","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proceedings of ECAI\u201904, vol.\u00a016, pp. 146\u2013150 (2004)"},{"issue":"4","key":"9434_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D.: New methods to color the vertices of a graph. Commun. ACM 22(4), 251\u2013256 (1979)","journal-title":"Commun. ACM"},{"issue":"12","key":"9434_CR6","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E.K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Qu, R.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695\u20131724 (2013)","journal-title":"J. Oper. Res. Soc."},{"key":"9434_CR7","doi-asserted-by":"crossref","unstructured":"Collavizza, H., Delobel, F., Rueher, M.: A note on partial consistencies over continuous domains. In: Proceedings of CP\u201998, pp. 147\u2013161. Springer (1998)","DOI":"10.1007\/3-540-49481-2_12"},{"issue":"2","key":"9434_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0004-3702(94)90068-X","volume":"68","author":"R Dechter","year":"1994","unstructured":"Dechter, R., Meiri, I.: Experimental evaluation of preprocessing algorithms for constraint satisfaction problems. Artif. Intell. 68(2), 211\u2013241 (1994)","journal-title":"Artif. Intell."},{"issue":"1","key":"9434_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"CP Gomes","year":"2001","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolios. Artif. Intell. 126(1), 43\u201362 (2001)","journal-title":"Artif. Intell."},{"key":"9434_CR10","unstructured":"Gomes, C.P., Selman, B., Kautz, H., et\u00a0al.: Boosting combinatorial search through randomization. In: Proceedings of AAAI\u201998, pp. 431\u2013437 (1998)"},{"issue":"3","key":"9434_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"RM Haralick","year":"1980","unstructured":"Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14(3), 263\u2013313 (1980)","journal-title":"Artif. Intell."},{"key":"9434_CR12","doi-asserted-by":"crossref","unstructured":"Hebrard, E., Siala, M.: Explanation-based weighted degree. In: Proceedings of CPAIOR\u201917, pp. 167\u2013175. Springer (2017)","DOI":"10.1007\/978-3-319-59776-8_13"},{"key":"9434_CR13","doi-asserted-by":"crossref","unstructured":"Hwang, J., Mitchell, D.G.: 2-way vs. d-way branching for csp. In: Proceedings of CP\u201905, pp. 343\u2013357. Springer (2005)","DOI":"10.1007\/11564751_27"},{"issue":"4","key":"9434_CR14","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10601-011-9107-6","volume":"16","author":"C Lecoutre","year":"2011","unstructured":"Lecoutre, C.: Str2: optimized simple tabular reduction for table constraints. Constraints 16(4), 341\u2013371 (2011)","journal-title":"Constraints"},{"key":"9434_CR15","unstructured":"Lecoutre, C., Hemery, F.: A study of residual supports in arc consistency. In: Proceedings of IJCAI\u201907, pp. 125\u2013130 (2007)"},{"issue":"99","key":"9434_CR16","doi-asserted-by":"publisher","first-page":"5798","DOI":"10.1109\/ACCESS.2017.2690672","volume":"5","author":"H Li","year":"2017","unstructured":"Li, H.: Narrowing support searching range in maintaining arc consistency for solving constraint satisfaction problems. IEEE Access 5(99), 5798\u20135803 (2017)","journal-title":"IEEE Access"},{"issue":"S\u20131","key":"9434_CR17","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s00521-017-3015-7","volume":"31","author":"H Li","year":"2019","unstructured":"Li, H., Li, R., Yin, M.: Saving constraint checks in maintaining coarse-grained generalized arc consistency. Neural Comput. Appl. 31(S\u20131), 499\u2013508 (2019)","journal-title":"Neural Comput. Appl."},{"key":"9434_CR18","doi-asserted-by":"crossref","unstructured":"Li, H., Liang, Y., Guo, J., Li, Z.: Making simple tabular reduction works on negative table constraints. In: Proceedings of AAAI\u201913, pp. 1629\u20131630. AAAI (2013)","DOI":"10.1609\/aaai.v27i1.8519"},{"issue":"2","key":"9434_CR19","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10732-015-9305-2","volume":"22","author":"H Li","year":"2016","unstructured":"Li, H., Liang, Y., Zhang, N., Guo, J., Xu, D., Li, Z.: Improving degree-based variable ordering heuristics for solving constraint satisfaction problems. J. Heuristics 22(2), 125\u2013145 (2016)","journal-title":"J. Heuristics"},{"key":"9434_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0004-3702(99)00097-1","volume":"116","author":"P Liberatore","year":"2000","unstructured":"Liberatore, P.: On the complexity of choosing the branching literal in dpll. Artif. Intell. 116, 315\u2013326 (2000)","journal-title":"Artif. Intell."},{"key":"9434_CR21","doi-asserted-by":"crossref","unstructured":"Loth, M., Sebag, M., Hamadi, Y., Schoenauer, M.: Bandit-based search for constraint programming. In: International Conference on Principles and Practice of Constraint Programming, pp. 464\u2013480. Springer (2013)","DOI":"10.1007\/978-3-642-40627-0_36"},{"issue":"3","key":"9434_CR22","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"AK Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artif. Intell. 8(3), 99\u2013118 (1977)","journal-title":"Artif. Intell."},{"key":"9434_CR23","doi-asserted-by":"crossref","unstructured":"Michel, L., Van\u00a0Hentenryck, P.: Activity-based search for black-box constraint programming solvers. In: Proceedings of CPAIOR\u201912, pp. 228\u2013243. Springer (2012)","DOI":"10.1007\/978-3-642-29828-8_15"},{"key":"9434_CR24","doi-asserted-by":"crossref","unstructured":"Ortiz-Bayliss, J.C., Terashima-Mar\u00edn, H., Conant-Pablos, S.E.: A supervised learning approach to construct hyper-heuristics for constraint satisfaction. In: Proceedings of Mexican Conference on Pattern Recognition, pp. 284\u2013293. Springer (2013)","DOI":"10.1007\/978-3-642-38989-4_29"},{"key":"9434_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10462-016-9466-x","volume":"46","author":"JC Ortiz-Bayliss","year":"2016","unstructured":"Ortiz-Bayliss, J.C., Terashima-Mar\u00edn, H., Conant-Pablos, S.E.: Combine and conquer: an evolutionary hyper-heuristic approach for solving constraint satisfaction problems. Artif. Intell. Rev. 46, 1\u201323 (2016)","journal-title":"Artif. Intell. Rev."},{"key":"9434_CR26","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1613\/jair.3463","volume":"43","author":"G Pesant","year":"2012","unstructured":"Pesant, G., Quimper, C.G., Zanarini, A.: Counting-based search: branching heuristics for constraint satisfaction problems. J. Artif. Intell. Res. 43, 173\u2013210 (2012)","journal-title":"J. Artif. Intell. Res."},{"key":"9434_CR27","unstructured":"Prud\u2019homme, C., Fages, J.G., Lorca, X.: Choco Documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S. (2016). http:\/\/www.choco-solver.org"},{"key":"9434_CR28","doi-asserted-by":"crossref","unstructured":"Refalo, P.: Impact-based search strategies for constraint programming. In: Proceedings of CP\u201904, pp. 557\u2013571. Springer (2004)","DOI":"10.1007\/978-3-540-30201-8_41"},{"issue":"1","key":"9434_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10489-011-0309-9","volume":"37","author":"NR Sabar","year":"2012","unstructured":"Sabar, N.R., Ayob, M., Qu, R., Kendall, G.: A graph coloring constructive hyper-heuristic for examination timetabling problems. Appl. Intell. 37(1), 1\u201311 (2012)","journal-title":"Appl. Intell."},{"issue":"1","key":"9434_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(95)00098-4","volume":"86","author":"NM Sadeh","year":"1995","unstructured":"Sadeh, N.M., Fox, M.S.: Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem. Artif. Intell. 86(1), 1\u201341 (1995)","journal-title":"Artif. Intell."},{"key":"9434_CR31","unstructured":"Schulte, C., Tack, G., Z., L.M.: Modeling and Programming with Gecode (2018). http:\/\/www.gecode.org\/documentation.html"},{"key":"9434_CR32","unstructured":"Streeter, M., Golovin, D., Smith, S.F.: Combining multiple heuristics online. In: Proceedings of AAAI\u201907, pp. 1197\u20131203 (2007)"},{"key":"9434_CR33","doi-asserted-by":"crossref","unstructured":"Terashima-Mar\u00edn, H., Ortiz-Bayliss, J.C., Ross, P., Valenzuela-Rend\u00f3n, M.: Hyper-heuristics for the dynamic variable ordering in constraint satisfaction problems. In: Proceedings of the 10th annual conference on Genetic and evolutionary computation, pp. 571\u2013578. ACM (2008)","DOI":"10.1145\/1389095.1389206"},{"key":"9434_CR34","unstructured":"Walsh, T.: Search in a small world. In: Proceedings of IJCAI\u201999, pp. 1172\u20131177 (1999)"},{"key":"9434_CR35","doi-asserted-by":"crossref","unstructured":"Wang, R., Xia, W., Yap, R.H.C.: Correlation heuristics for constraint programming. In: Proceedings of ICTAI\u201917, pp. 1037\u20131041. IEEE (2017)","DOI":"10.1109\/ICTAI.2017.00159"},{"key":"9434_CR36","doi-asserted-by":"crossref","unstructured":"Xia, W., Yap, R.H.C.: Learning robust search strategies using a bandit-based approach. In: Proceedings of AAAI\u201918, pp. 431\u2013437 (2018)","DOI":"10.1609\/aaai.v32i1.12211"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09434-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-019-09434-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09434-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T05:10:59Z","timestamp":1665551459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-019-09434-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,21]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["9434"],"URL":"https:\/\/doi.org\/10.1007\/s10732-019-09434-9","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2020,1,21]]},"assertion":[{"value":"23 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}