{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T00:14:01Z","timestamp":1783815241621,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819502141","type":"print"},{"value":"9789819502158","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-0215-8_10","type":"book-chapter","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T16:25:47Z","timestamp":1753979147000},"page":"123-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improving Local Search for\u00a0Weighted Partial MaxSAT by\u00a0Initializing with\u00a0Historical Information"],"prefix":"10.1007","author":[{"given":"Menghua","family":"Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,1]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Bonet, B., Frances, G., Geffner, H.: Learning features and abstract actions for computing generalized plans. In: Proceedings of AAAI, pp. 2703\u20132710 (2019)","DOI":"10.1609\/aaai.v33i01.33012703"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Lemos, A., Monteiro, P.T., Lynce, I.: Minimal perturbation in university timetabling with maximum satisfiability. In: Proceedings of CPAIOR, pp. 317\u2013333 (2020)","DOI":"10.1007\/978-3-030-58942-4_21"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Khadilkar, H.: Solving the capacitated vehicle routing problem with timing windows using rollouts and max-sat. In: Proceedings of ICC, pp. 1\u20136 (2022)","DOI":"10.1109\/ICC56513.2022.10093678"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10732-022-09495-3","volume":"28","author":"C Ans\u00f3tegui","year":"2022","unstructured":"Ans\u00f3tegui, C., Many\u00e0, F., Ojeda, J., Salvia, J.M., Torres, E.: Incomplete MaxSAT approaches for combinatorial testing. J. Heuristics 28, 377\u2013431 (2022)","journal-title":"J. Heuristics"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Li, C.-M., Xu, Z., Coll, J., Many\u00e0, F., Habet, D., He, K.: Combining clause learning and branch and bound for MaxSAT. In: Proceedings of CP, pp. 38\u20131 (2021)","DOI":"10.24963\/ijcai.2022\/739"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Bacchus, F., J\u00e4rvisalo, M., Martins, R.: Maximum satisfiabiliy. In: Handbook of Satisfiability. IOS Press, pp. 929\u2013991 (2021)","DOI":"10.3233\/FAIA201008"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Fu, Z., Malik, S.: On solving the partial max-sat problem. In: Proceedings of SAT, pp. 252\u2013265 (2006)","DOI":"10.1007\/11814948_25"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: Solving (weighted) partial MaxSAT through satisfiability testing. In: Proceedings of SAT, pp. 427\u2013440 (2009)","DOI":"10.1007\/978-3-642-02777-2_39"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.artint.2017.05.003","volume":"250","author":"C Ans\u00f3tegui","year":"2017","unstructured":"Ans\u00f3tegui, C., Gab\u00e0s, J.: WPM3: an (in) complete algorithm for weighted partial MaxSAT. Artif. Intell. 250, 37\u201357 (2017)","journal-title":"Artif. Intell."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Berg, J., Demirovi\u0107, E., Stuckey, P.J.: Core-boosted linear search for incomplete maxSAT. In: Proceedings of CPAIOR, pp. 39\u201356 (2019)","DOI":"10.1007\/978-3-030-19212-9_3"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Nadel, A.: Anytime weighted MaxSAT with improved polarity selection and bit-vector optimization. In: Proceedings of FMCAD, pp. 193\u2013202 (2019)","DOI":"10.23919\/FMCAD.2019.8894273"},{"key":"10_CR12","unstructured":"Cha, B., Iwama, K., Kambayashi, Y., Miyazaki, S.: Local search algorithms for partial MaxSAT. In: Proceedings of AAAI, pp. 263\u2013268 (1997)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Cai, S., Luo, C., Zhang, H.: From decimation to local search and back: a new approach to MaxSAT. In: Proceedings of IJCAI, pp. 571\u2013577 (2017)","DOI":"10.24963\/ijcai.2017\/80"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Zheng, J., He, K., Zhou, J., Jin, Y., Li, C.-M., Manya, F.: BandMaxSAT: a local search MaxSAT solver with multi-armed bandit. In: Proceedings of IJCAI, pp. 1901\u20131907 (2022)","DOI":"10.24963\/ijcai.2022\/264"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Zheng, J., He, K., Zhou, J.: Farsighted probabilistic sampling: a general strategy for boosting local search MaxSAT solvers. In: Proceedings of AAAI, pp. 4132\u20134139 (2023)","DOI":"10.1609\/aaai.v37i4.25529"},{"key":"10_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2024.104242","volume":"338","author":"J Zheng","year":"2025","unstructured":"Zheng, J., He, K., Zhou, J., Jin, Y., Li, C.-M., Many\u00e0, F.: Integrating multi-armed bandit with local search for MaxSAT. Artif. Intell. 338, 104242 (2025)","journal-title":"Artif. Intell."},{"key":"10_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103354","volume":"287","author":"S Cai","year":"2020","unstructured":"Cai, S., Lei, Z.: Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability. Artif. Intell. 287, 103354 (2020)","journal-title":"Artif. Intell."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Chu, Y., Cai, S., Luo, C.: NuWLS: improving local search for (weighted) partial MaxSAT by new weighting techniques. In: Proceedings of AAAI, pp. 3915\u20133923 (2023)","DOI":"10.1609\/aaai.v37i4.25505"},{"key":"10_CR19","unstructured":"Chu, Y., Li, C.-M., Ye, F., Cai, S.: Enhancing MaxSAT local search via a unified soft clause weighting scheme. In: Proceedings of SAT, pp. 8\u20131 (2024)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Zheng, J., Chen, Z., Li, C.-M., He, K.: Rethinking the soft conflict pseudo Boolean constraint on MaxSAT local search solvers. In: Proceedings of IJCAI, pp. 1989\u20131997 (2024)","DOI":"10.24963\/ijcai.2024\/220"},{"key":"10_CR21","unstructured":"Cai, S.: Balance between complexity and quality: local search for minimum vertex cover in massive graphs. In: Proceedings of IJCAI, pp. 747\u2013753 (2015)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0215-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T09:37:26Z","timestamp":1757324246000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0215-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"ISBN":["9789819502141","9789819502158"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0215-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,1]]},"assertion":[{"value":"1 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}