{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:29:30Z","timestamp":1773930570917,"version":"3.50.1"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T00:00:00Z","timestamp":1700870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T00:00:00Z","timestamp":1700870400000},"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":["Front. Comput. Sci."],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s11704-023-3018-8","type":"journal-article","created":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T04:21:55Z","timestamp":1700886115000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["DeciLS-PBO: an effective local search method for pseudo-Boolean optimization"],"prefix":"10.1007","volume":"18","author":[{"given":"Luyu","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dantong","family":"Ouyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liming","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,25]]},"reference":[{"key":"3018_CR1","doi-asserted-by":"crossref","unstructured":"Lei Z, Cai S, Luo C, Hoos H. Efficient local search for pseudo Boolean optimization. In: Proceedings of the 24th International Conference on Theory and Applications of Satisfiability Testing. 2021, 332\u2013348","DOI":"10.1007\/978-3-030-80223-3_23"},{"key":"3018_CR2","doi-asserted-by":"crossref","unstructured":"Lei Z, Cai S, Luo C. Extended conjunctive normal form and an efficient algorithm for cardinality constraints. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence. 2020, 1141\u20131147","DOI":"10.24963\/ijcai.2020\/159"},{"key":"3018_CR3","doi-asserted-by":"crossref","unstructured":"Berg J, Demirovi\u0107 E, Stuckey P J. Core-boosted linear search for incomplete MaxSAT. In: Proceedings of the 16th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research. 2019, 39\u201356","DOI":"10.1007\/978-3-030-19212-9_3"},{"key":"3018_CR4","doi-asserted-by":"crossref","unstructured":"Elffers J, Nordstrom J. Divide and conquer: towards faster pseudo-Boolean solving. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence. 2018, 1291\u20131299","DOI":"10.24963\/ijcai.2018\/180"},{"key":"3018_CR5","doi-asserted-by":"crossref","unstructured":"Martins R, Manquinho V, Lynce I. Open-WBO: a modular MaxSAT solver. In: Proceedings of the 17th International Conference on Theory and Applications of Satisfiability Testing. 2014, 438\u2013445","DOI":"10.1007\/978-3-319-09284-3_33"},{"key":"3018_CR6","doi-asserted-by":"crossref","unstructured":"Lei Z, Cai S. Solving (weighted) partial MaxSAT by dynamic local search for SAT. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence. 2018, 1346\u20131352","DOI":"10.24963\/ijcai.2018\/187"},{"key":"3018_CR7","unstructured":"Smirnov P, Berg J, J\u00e4rvisalo M. Improvements to the implicit hitting set approach to pseudo-Boolean optimization. In: Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing. 2022, 13: 1\u201313: 18"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-023-3018-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-023-3018-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-023-3018-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T04:30:10Z","timestamp":1700886610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-023-3018-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,25]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["3018"],"URL":"https:\/\/doi.org\/10.1007\/s11704-023-3018-8","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,25]]},"assertion":[{"value":"7 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"<b>Competing interests<\/b> The authors declare that they have no competing interests or financial conflicts to disclose.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics"}}],"article-number":"182326"}}