Improving local search algorithm for pseudo Boolean optimization

DOI10.1613/JAIR.1.16626MaRDI QIDQ6912825zbMATH OpenFDO

Authors Yujiao Zhao, Yiyuan Wang, Yi Chu, Wenbo Zhou, Shaowei Cai, Minghao Yin

Publication date 22 October 2025

Published in The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

combinatorial optimizationheuristic searchBoolean satisfiability

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cites work

• scientific article; zbMATH DE number 5139161 (Why is no real title available?)
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• Efficient local search for pseudo Boolean optimization
• Finding a small vertex cover in massive sparse graphs: construct, local search, and preprocess
• Improvements to the implicit hitting set approach to pseudo-Boolean optimization
• In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving
• Integrating multi-armed bandit with local search for MaxSAT
• Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
• Open-WBO: a modular MaxSAT solver
• Randomized allocation with nonparametric estimation for contextual multi-armed bandits with delayed rewards
• SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
• The complexity of theorem-proving procedures
• Where are the hard knapsack problems?

This page was built for publication: Improving local search algorithm for pseudo Boolean optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912825)