Efficient local search for pseudo Boolean optimization

DOI10.1007/978-3-030-80223-3_23MaRDI QIDQ2118314zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

local searchpseudo Boolean optimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

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

• 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
• scientific article; zbMATH DE number 5139165 (Why is no real title available?)
• 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

(8)

• Approximation of Boolean functions by local search
• Propagation based local search for bit-precise reasoning
• Partition Crossover for Pseudo-Boolean Optimization
• An efficient local search algorithm for minimum positive influence dominating set problem
• Feasibility jump: an LP-free Lagrangian MIP heuristic
• Improving local search algorithm for pseudo Boolean optimization
• Local-MIP: efficient local search for mixed integer programming
• Automatic algorithm selection for pseudo-Boolean optimization with given computational time limits

Describes a project that uses

Uses Software

• Gurobi
• Open-WBO
• SATLike
• PBLib

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)