Efficient local search for pseudo Boolean optimization
From MaRDI portal
Publication:2118314
DOI10.1007/978-3-030-80223-3_23OpenAlexW3183162149MaRDI QIDQ2118314FDOQ2118314
Authors: Zhendong Lei, Shaowei Cai, Chuan Luo, Holger H. Hoos 
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_23
Recommendations
- Local search over a generalized neighborhood for an optimization problem of pseudo-Boolean functions
- Approximation of Boolean functions by local search
- scientific article; zbMATH DE number 1247626
- Pseudo-Boolean optimization
- Using stochastic local search to solve quantified Boolean formulae
- Approximate local search in combinatorial optimization
- Approximate Local Search in Combinatorial Optimization
- Optimization over pseudo-Boolean lattices
- scientific article; zbMATH DE number 1016966
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
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)
