Local Search with a SAT Oracle for Combinatorial Optimization.
Aviad CohenAlexander NadelVadim RyvchinPublished in: TACAS (2) (2021)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- simulated annealing
- branch and bound
- branch and bound algorithm
- metaheuristic
- traveling salesman problem
- boolean satisfiability
- combinatorial problems
- satisfiability problem
- sat problem
- max sat
- sat solvers
- mathematical programming
- stochastic local search
- memetic algorithm
- search algorithm
- propositional satisfiability
- oracle database
- optimization problems
- hard combinatorial optimization problems
- job shop scheduling problem
- phase transition
- quadratic assignment problem
- satisfiability testing
- search procedures
- vehicle routing problem
- evolutionary algorithm
- estimation of distribution algorithms
- sat solving
- tabu search
- exact algorithms
- search strategies
- path relinking
- constraint satisfaction
- heuristic search