{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:40:44Z","timestamp":1742931644149,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030436797"},{"type":"electronic","value":"9783030436803"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43680-3_6","type":"book-chapter","created":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T23:04:05Z","timestamp":1586387045000},"page":"83-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Cooperative Parallel SAT Local Search with Path Relinking"],"prefix":"10.1007","author":[{"given":"Padraigh","family":"Jarvis","sequence":"first","affiliation":[]},{"given":"Alejandro","family":"Arbelaez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,9]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-37198-1_14","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"A Arbelaez","year":"2013","unstructured":"Arbelaez, A., Codognet, P.: From sequential to parallel local search for SAT. In: Middendorf, M., Blum, C. (eds.) EvoCOP 2013. LNCS, vol. 7832, pp. 157\u2013168. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37198-1_14"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-25566-3_4","volume-title":"Learning and Intelligent Optimization","author":"A Arbelaez","year":"2011","unstructured":"Arbelaez, A., Hamadi, Y.: Improving parallel local search for SAT. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 46\u201360. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_4"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-21434-9_9","volume-title":"Autonomous Search","author":"A Arbelaez","year":"2011","unstructured":"Arbelaez, A., Hamadi, Y., Sebag, M.: Continuous search in constraint programming. In: Hamadi, Y., Monfroy, E., Saubion, F. (eds.) Autonomous Search, pp. 219\u2013243. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21434-9_9"},{"key":"6_CR4","unstructured":"Birattari, M., St\u00fctzle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: GECCO, pp. 11\u201318 (2002)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2016.07.006","volume":"240","author":"S Cai","year":"2016","unstructured":"Cai, S., Luo, C., Lin, J., Su, K.: New local search methods for partial MaxSAT. Artif. Intell. 240, 1\u201318 (2016)","journal-title":"Artif. Intell."},{"issue":"1\u20133","key":"6_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0166-218X(94)90211-9","volume":"49","author":"F Glover","year":"1994","unstructured":"Glover, F.: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). Discrete Appl. Math. 49(1\u20133), 231\u2013255 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"6_CR7","first-page":"245","volume":"6","author":"Y Hamadi","year":"2009","unstructured":"Hamadi, Y., Jabbour, S., Sais, L.: ManySAT: a parallel SAT solver. JSAT 6(4), 245\u2013262 (2009)","journal-title":"JSAT"},{"key":"6_CR8","unstructured":"Hoos, H.H.: An adaptive noise mechanism for WalkSAT. In: AAAI\/IAAI, pp. 655\u2013660 (2002)"},{"issue":"1\u20132","key":"6_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10472-010-9191-0","volume":"60","author":"F Hutter","year":"2010","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Tradeoffs in the empirical evaluation of competing algorithm designs. Ann. Math. Artif. Intell. 60(1\u20132), 65\u201389 (2010)","journal-title":"Ann. Math. Artif. Intell."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an automatic algorithm configuration framework. J. Artif. Intell. Res. 36, 267\u2013306 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-72788-0_15","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"CM Li","year":"2007","unstructured":"Li, C.M., Wei, W., Zhang, H.: Combining adaptive noise and look-ahead in local search for SAT. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 121\u2013133. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72788-0_15"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.artint.2016.11.001","volume":"243","author":"C Luo","year":"2017","unstructured":"Luo, C., Cai, S., Su, K., Huang, W.: CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability. Artif. Intell. 243, 26\u201344 (2017)","journal-title":"Artif. Intell."},{"issue":"7","key":"6_CR13","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1109\/TC.2014.2346196","volume":"64","author":"C Luo","year":"2015","unstructured":"Luo, C., Cai, S., Wu, W., Jie, Z., Su, K.: CCLS: an efficient local search algorithm for weighted maximum satisfiability. IEEE Trans. Comput. 64(7), 1830\u20131843 (2015)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/s10601-012-9121-3","volume":"17","author":"R Martins","year":"2012","unstructured":"Martins, R., Manquinho, V.M., Lynce, I.: An overview of parallel SAT solving. Constraints 17(3), 304\u2013347 (2012)","journal-title":"Constraints"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1007\/3-540-46135-3_51","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"A Roli","year":"2002","unstructured":"Roli, A.: Criticality and parallelism in structured SAT instances. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 714\u2013719. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46135-3_51"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Roli, A., Blesa, M.J., Blum, C.: Random walk and parallelism in local search. In: Metaheuristic International Conference (MIC 2005), Vienna, Austria (2005)","DOI":"10.1007\/11546245"},{"key":"6_CR17","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Noise strategies for improving local search. In: AAAI, pp. 337\u2013343 (1994)"},{"key":"6_CR18","unstructured":"Selman, B., Levesque, H.J., Mitchell, D.G.: A new method for solving hard satisfiability problems. In: AAAI 1996, pp. 440\u2013446 (1996)"},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1287\/opre.1040.0189","volume":"53","author":"DM Strickland","year":"2005","unstructured":"Strickland, D.M., Barnes, E.R., Sokol, J.S.: Optimal protein structure alignment using maximum cliques. Oper. Res. 53(3), 389\u2013402 (2005)","journal-title":"Oper. Res."},{"key":"6_CR20","unstructured":"Thornton, J., Pham, D.N., Bain, S., Ferreira Jr., V.: Additive versus multiplicative clause weighting for SAT. In: AAAI. pp. 191\u2013196 (2004)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/11527695_24","volume-title":"Theory and Applications of Satisfiability Testing","author":"DAD Tompkins","year":"2005","unstructured":"Tompkins, D.A.D., Hoos, H.H.: UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 306\u2013320. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11527695_24"},{"issue":"2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1011203002719","volume":"20","author":"M Vasquez","year":"2001","unstructured":"Vasquez, M., Hao, J.: A \u201clogic-constrained\u201d knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite. Comput. Optim. Appl. 20(2), 137\u2013157 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"6_CR23","unstructured":"Zhang, L., Bacchus, F.: MAXSAT heuristics for cost optimal planning. In: AAAI 2012 (2012)"},{"key":"6_CR24","unstructured":"Zhang, W., Rangan, A., Looks, M.: Backbone guided local search for maximum satisfiability. In: IJCAI 2003, pp. 1179\u20131186 (2003)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43680-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T19:04:59Z","timestamp":1614884699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43680-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030436797","9783030436803"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43680-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seville","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.68","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.88","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}