Efficient local search for pseudo Boolean optimization
From MaRDI portal
Publication:2118314
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
Cites work
- scientific article; zbMATH DE number 5139165 (Why is no real title available?)
- Branch-and-Bound Methods: A Survey
- Comparisons of commercial MIP solvers and an adaptive memory (tabu search) procedure for a class of 0-1 integer programming problems
- Core-boosted linear search for incomplete MaxSAT
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Open-WBO: a modular MaxSAT solver
- PBLib -- a library for encoding pseudo-Boolean constraints into CNF
- Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers
Cited in
(5)
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)