{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T18:02:33Z","timestamp":1769968953369,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,2,3]],"date-time":"2015-02-03T00:00:00Z","timestamp":1422921600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10732-015-9284-3","type":"journal-article","created":{"date-parts":[[2015,2,2]],"date-time":"2015-02-02T01:55:36Z","timestamp":1422842136000},"page":"433-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An effective variable selection heuristic in SLS for weighted Max-2-SAT"],"prefix":"10.1007","volume":"21","author":[{"given":"Shaowei","family":"Cai","sequence":"first","affiliation":[]},{"given":"Zhong","family":"Jie","sequence":"additional","affiliation":[]},{"given":"Kaile","family":"Su","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,3]]},"reference":[{"key":"9284_CR1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.artint.2013.01.002","volume":"196","author":"C Ans\u00f3tegui","year":"2013","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: SAT-based MaxSAT algorithms. Artif. Intell. 196, 77\u2013105 (2013)","journal-title":"Artif. Intell."},{"key":"9284_CR2","doi-asserted-by":"crossref","unstructured":"Cai, S., Su, K.: Local search with configuration checking for SAT. In: Proceeding of the ICTAI-11, pp. 59\u201366 (2011)","DOI":"10.1109\/ICTAI.2011.18"},{"key":"9284_CR3","doi-asserted-by":"crossref","unstructured":"Cai, S., Su, K.: Configuration checking with aspiration in local search for SAT. In: Proceedings of the AAAI-12, pp. 434\u2013440 (2012)","DOI":"10.1609\/aaai.v26i1.8133"},{"key":"9284_CR4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.artint.2013.09.001","volume":"204","author":"S Cai","year":"2013","unstructured":"Cai, S., Su, K.: Local search for Boolean satisfiability with configuration checking and subscore. Artif. Intell. 204, 75\u201398 (2013)","journal-title":"Artif. Intell."},{"issue":"9\u201310","key":"9284_CR5","doi-asserted-by":"crossref","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","volume":"175","author":"S Cai","year":"2011","unstructured":"Cai, S., Su, K., Sattar, A.: Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artif. Intell. 175(9\u201310), 1672\u20131696 (2011)","journal-title":"Artif. Intell."},{"key":"9284_CR6","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1613\/jair.3907","volume":"46","author":"S Cai","year":"2013","unstructured":"Cai, S., Su, K., Luo, C., Sattar, A.: NuMVC: an efficient local search algorithm for minimum vertex cover. J. Artif. Intell. Res. 46, 687\u2013716 (2013)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"9284_CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/1198255.1198259","volume":"37","author":"X Dimitropoulos","year":"2007","unstructured":"Dimitropoulos, X., Krioukov, D., Fomenkov, M., Huffaker, B., Hyun, Y., Claffy, K., Riley, G.: As relationships: inference and validation. Comput. Commun. Rev. 37(1), 29\u201340 (2007)","journal-title":"Comput. Commun. Rev."},{"key":"9284_CR8","doi-asserted-by":"crossref","unstructured":"Festa, P., Pardalos, P., Pitsoulis, L., Resende, M.: GRASP with path relinking for the weighted Max-SAT problem. ACM J. Exp. Algorithmics (11) (2006)","DOI":"10.1145\/1187436.1216581"},{"issue":"3","key":"9284_CR9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search\u2014part I. INFORMS J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"9284_CR10","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0166-218X(02)00402-X","volume":"130","author":"J Gramm","year":"2003","unstructured":"Gramm, J., Hirsch, E., Niedermeier, R., Rossmanith, P.: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discret. Appl. Math. 130(2), 139\u2013155 (2003)","journal-title":"Discret. Appl. Math."},{"issue":"6","key":"9284_CR11","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10732-007-9055-x","volume":"14","author":"A Grosso","year":"2008","unstructured":"Grosso, A., Locatelli, M., Pullan, W.: Simple ingredients leading to very efficient heuristics for the maximum clique problem. J. Heuristics 14(6), 587\u2013612 (2008)","journal-title":"J. Heuristics"},{"issue":"3","key":"9284_CR12","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10623-003-6738-7","volume":"35","author":"H Haanp\u00e4\u00e4","year":"2005","unstructured":"Haanp\u00e4\u00e4, H., Kaski, P.: The near resolvable 2-(13, 4, 3) designs and thirteen-player whist tournaments. Des. Codes. Cryptogr. 35(3), 271\u2013285 (2005)","journal-title":"Des. Codes. Cryptogr."},{"key":"9284_CR13","first-page":"89","volume":"7","author":"F Heras","year":"2010","unstructured":"Heras, F., Ba\u00f1eres, D.: The impact of Max-SAT resolution-based preprocessors on local search solvers. J. Satisf. Boolean Model. Comput. 7, 89\u2013126 (2010)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"9284_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.2347","volume":"31","author":"F Heras","year":"2008","unstructured":"Heras, F., Larrosa, J., Oliveras, A.: MiniMax-SAT: an efficient weighted max-sat solver. J. Artif. Intell. Res. (JAIR) 31, 1\u201332 (2008)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"9284_CR15","unstructured":"Hoos, H.H.: On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT. In: Proceedings of the AAAI-99, pp. 661\u2013666 (1999)"},{"key":"9284_CR16","unstructured":"Hoos, H.H.: An adaptive noise mechanism for WalkSAT. In: Proceedings of the AAAI-02, pp. 655\u2013660 (2002)"},{"key":"9284_CR17","volume-title":"Stochastic Local Search: Foundations & Applications","author":"HH Hoos","year":"2004","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations & Applications. Elsevier, Amsterdam (2004)"},{"key":"9284_CR18","doi-asserted-by":"crossref","unstructured":"Hutter, F., Tompkins, D.A.D., Hoos, H.H.: Scaling and probabilistic smoothing: efficient dynamic local search for SAT. In: Proceedings of the CP-02, pp. 233\u2013248 (2002)","DOI":"10.1007\/3-540-46135-3_16"},{"issue":"1","key":"9284_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1119439.1119440","volume":"7","author":"T Janhunen","year":"2006","unstructured":"Janhunen, T., Niemel\u00e4, I., Seipel, D., Simons, P., You, J.H.: Unfolding partiality and disjunctions in stable model semantics. ACM Trans. Comput. Log. 7(1), 1\u201337 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"9284_CR20","doi-asserted-by":"crossref","unstructured":"Kastner, R., Bozorgzadeh, E., Sarrafzadeh, M.: Pattern routing: use and theory for increasing predictability and avoiding coupling. In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, pp. 233\u2013248 (2002)","DOI":"10.1109\/TCAD.2002.1013891"},{"key":"9284_CR21","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1504\/IJOR.2005.007435","volume":"1","author":"G Kochenberger","year":"2005","unstructured":"Kochenberger, G., Glover, F., Alidaee, B., Lewis, K.: Using the unconstrained quadratic program to model and solve Max-2-SAT problems. Int. J. Oper. Res. 1, 89\u2013100 (2005)","journal-title":"Int. J. Oper. Res."},{"key":"9284_CR22","unstructured":"Kroc, L., Sabharwal, A., Gomes, C., Selman, B.: Integrating systematic and local search paradigms: a new strategy for MaxSAT. In: Proceedings of the IJCAI-09, pp. 544\u2013551 (2009)"},{"key":"9284_CR23","doi-asserted-by":"crossref","unstructured":"Li, C., Huang, W.: Diversification and determinism in local search for satisfiability. In: Proceedings of the SAT-05, pp. 158\u2013172 (2005)","DOI":"10.1007\/11499107_12"},{"key":"9284_CR24","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1613\/jair.2215","volume":"30","author":"C Li","year":"2007","unstructured":"Li, C., Many\u00e0, F., Planes, J.: New inference rules for Max-SAT. J. Artif. Intell. Res. (JAIR) 30, 321\u2013359 (2007)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"9284_CR25","doi-asserted-by":"crossref","unstructured":"Li, C., Many\u00e0, F., Mohamedou, N., Planes, J.: Exploiting cycle structures in Max-SAT. In: Proceedings of the SAT-09, pp. 467\u2013480 (2009)","DOI":"10.1007\/978-3-642-02777-2_43"},{"key":"9284_CR26","doi-asserted-by":"crossref","unstructured":"Li, C., Wei, W., Zhang, H.: Combining adaptive noise and look-ahead in local search for SAT. In: Proceedings of the SAT-07, pp. 121\u2013133 (2007)","DOI":"10.1007\/978-3-540-72788-0_15"},{"key":"9284_CR27","unstructured":"Lin, H., Su, K., Li, C.: Within-problem learning for efficient lower bound computation in max-sat solving. In: Proceedings of the AAAI-08, pp. 351\u2013356 (2008)"},{"issue":"3","key":"9284_CR28","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1023\/A:1017584715408","volume":"27","author":"ML Littman","year":"2001","unstructured":"Littman, M.L., Majercik, S.M., Pitassi, T.: Stochastic boolean satisfiability. J. Autom. Reason. 27(3), 251\u2013296 (2001)","journal-title":"J. Autom. Reason."},{"key":"9284_CR29","unstructured":"Luo, C., Su, K., Cai, S.: Improving local search for random 3-SAT using quantitative configuration checking. In: Proceedings of the ECAI-12, pp. 570\u2013575 (2012)"},{"key":"9284_CR30","doi-asserted-by":"crossref","unstructured":"Luo, C., Cai, S., Wu, W., Su, K.: Focused random walk with configuration checking and break minimum for satisfiability. In: Proceedings of the CP-13, pp. 481\u2013496 (2013)","DOI":"10.1007\/978-3-642-40627-0_37"},{"key":"9284_CR31","first-page":"275","volume":"37","author":"G Palubeckis","year":"2008","unstructured":"Palubeckis, G.: Solving the weighted Max-2-SAT problem with iterated tabu search. J. Inf. Technol. Control 37, 275\u2013284 (2008)","journal-title":"J. Inf. Technol. Control"},{"issue":"2","key":"9284_CR32","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10732-010-9131-5","volume":"17","author":"W Pullan","year":"2011","unstructured":"Pullan, W., Mascia, F., Brunato, M.: Cooperating local search for the maximum clique problem. J. Heuristics 17(2), 181\u2013199 (2011)","journal-title":"J. Heuristics"},{"key":"9284_CR33","doi-asserted-by":"crossref","first-page":"1975","DOI":"10.1016\/j.cor.2004.09.030","volume":"33","author":"M Ryuhei","year":"2006","unstructured":"Ryuhei, M., Tomomi, M.: Semidefinite programming based approaches to the break minimization problem. Comput. OR 33, 1975\u20131982 (2006)","journal-title":"Comput. OR"},{"key":"9284_CR34","unstructured":"Selman, B., Kautz, H., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the AAAI-94, pp. 337\u2013343 (1994)"},{"issue":"1\u20132","key":"9284_CR35","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and implementing the stable model semantics. Artif. Intell. 138(1\u20132), 181\u2013234 (2002)","journal-title":"Artif. Intell."},{"key":"9284_CR36","doi-asserted-by":"crossref","unstructured":"Smyth, K., Hoos, H.H., St\u00fctzle, T.: Iterated robust tabu search for MAX-SAT. In: Proceedings of the Canadian Conference on AI, pp. 129\u2013144 (2003)","DOI":"10.1007\/3-540-44886-1_12"},{"key":"9284_CR37","unstructured":"Staub, R., Prautzsch, H.: Creating optimized cutout sheets for paper models from meshes. In: Ninth SIAM Conference on Geometric Design and Computing (2005)"},{"key":"9284_CR38","unstructured":"Wu, Z., Wah, B.W.: An efficient global-search strategy in discrete lagrangian methods for solving hard satisfiability problems. In: Proceedings of the AAAI-00, pp. 310\u2013315 (2000)"},{"key":"9284_CR39","unstructured":"Xu, K., Boussemart, F., Hemery, F., Lecoutre, C.: A simple model to generate hard satisfiable instances. In: Proceedings of the IJCAI-05, pp. 337\u2013342 (2005)"},{"issue":"8\u20139","key":"9284_CR40","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1016\/j.artint.2007.04.001","volume":"171","author":"K Xu","year":"2007","unstructured":"Xu, K., Boussemart, F., Hemery, F., Lecoutre, C.: Random constraint satisfaction: easy generation of hard (satisfiable) instances. Artif. Intell. 171(8\u20139), 514\u2013534 (2007)","journal-title":"Artif. Intell."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-015-9284-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-015-9284-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-015-9284-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T13:01:25Z","timestamp":1690981285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-015-9284-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,3]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["9284"],"URL":"https:\/\/doi.org\/10.1007\/s10732-015-9284-3","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,3]]}}}