Efficient local search for pseudo Boolean optimization
From MaRDI portal
Publication:2118314
DOI10.1007/978-3-030-80223-3_23OpenAlexW3183162149MaRDI QIDQ2118314FDOQ2118314
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07)
Cites Work
- PBLib β A Library for Encoding Pseudo-Boolean Constraints into CNF
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Branch-and-Bound Methods: A Survey
- Open-WBO: A Modular MaxSAT Solver,
- Title not available (Why is that?)
- Comparisons of commercial MIP solvers and an adaptive memory (tabu search) procedure for a class of 0-1 integer programming problems
- Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers
- Core-boosted linear search for incomplete MaxSAT
Cited In (5)
Uses Software
Recommendations
- Local search over a generalized neighborhood for an optimization problem of pseudo-Boolean functions π π
- Approximation of Boolean functions by local search π π
- Title not available (Why is that?) π π
- Pseudo-Boolean optimization π π
- Using stochastic local search to solve quantified Boolean formulae π π
- Title not available (Why is that?) π π
- Approximate Local Search in Combinatorial Optimization π π
- Optimization over pseudo-Boolean lattices π π
- Title not available (Why is that?) π π
This page was built for publication: Efficient local search for pseudo Boolean optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118314)