Local search with a SAT oracle for combinatorial optimization

DOI10.1007/978-3-030-72013-1_5MaRDI QIDQ2233496zbMATH OpenOpenAlexFDO

Authors Aviad Cohen, Alexander Nadel, Vadim Ryvchin

Publication date 18 October 2021

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-72013-1_5

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1943828
• Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
• Incremental Algorithms for Local Search from Existential Second-Order Logic
• Computing with SAT oracles: past, present and future
• Stochastic local search - methods, models, applications (Diss., TU Darmstadt, 1998)

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1016966 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 802995 (Why is no real title available?)
• scientific article; zbMATH DE number 7124428 (Why is no real title available?)
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• A Decision Procedure for Bit-Vectors and Arrays
• Combinatorial optimization in VLSI design
• Combinatorial optimization. Theory and algorithms
• Combining the scalability of local search with the pruning techniques of systematic search
• Design of modern heuristics. Principles and application.
• Efficient SAT solving under assumptions
• Handbook of metaheuristics
• Metaheuristics. From design to implementation.
• Operations research problems. Statements and solutions
• Optimal rectangle packing
• Optimization in SMT with \(\mathcal{LA}(\mathbb Q)\) cost functions
• Polarity and variable selection heuristics for SAT-based anytime MaxSAT
• Theory and Applications of Satisfiability Testing

Cited in

(7)

• scientific article; zbMATH DE number 1943828 (Why is no real title available?)
• SAT local search algorithms: Worst-case study
• Local search algorithms for SAT: an empirical evaluation
• LocalSolver 1.x: A black-box local-search solver for 0-1 programming
• The SAT+CAS method for combinatorial search with applications to best matrices
• scientific article; zbMATH DE number 956863 (Why is no real title available?)
• scientific article; zbMATH DE number 5510694 (Why is no real title available?)

This page was built for publication: Local search with a SAT oracle for combinatorial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233496)