Efficient local search for pseudo Boolean optimization
From MaRDI portal
Publication:2118314
DOI10.1007/978-3-030-80223-3_23OpenAlexW3183162149MaRDI QIDQ2118314
Zhendong Lei, Shaowei Cai, Holger H. Hoos, Chuan Luo
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_23
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)
Related Items (2)
An efficient local search algorithm for minimum positive influence dominating set problem ⋮ Feasibility jump: an LP-free Lagrangian MIP heuristic
Uses Software
Cites Work
- Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Core-boosted linear search for incomplete MaxSAT
- Open-WBO: A Modular MaxSAT Solver,
- PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF
- Branch-and-Bound Methods: A Survey
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficient local search for pseudo Boolean optimization
