Local search with a SAT oracle for combinatorial optimization

DOI10.1007/978-3-030-72013-1_5zbMath1474.68325OpenAlexW3138319291MaRDI QIDQ2233496

Aviad Cohen, Alexander Nadel, Vadim Ryvchin

Publication date: 18 October 2021

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

Mathematics Subject Classification ID

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

Cites Work

• Optimal rectangle packing
• Design of modern heuristics. Principles and application.
• Combining the scalability of local search with the pruning techniques of systematic search
• Efficient SAT Solving under Assumptions
• Operations Research Problems
• Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost Functions
• Polarity and Variable Selection Heuristics for SAT-Based Anytime MaxSAT
• Theory and Applications of Satisfiability Testing
• A Decision Procedure for Bit-Vectors and Arrays
• Handbook of metaheuristics
• Combinatorial optimization. Theory and algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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