Stable Resolving - A Randomized Local Search Heuristic for MaxSAT.
Julian ReischPeter GroßmannNatalia KliewerPublished in: KI (2020)
Keyphrases
- combinatorial optimization
- search algorithm
- tie breaking
- optimal solution
- simulated annealing
- tabu search
- job shop scheduling problem
- branch and bound algorithm
- domain independent planning
- metaheuristic
- neighborhood search
- search procedure
- search strategies
- optimization problems
- traveling salesman problem
- satisfiability testing
- search space
- multi start
- sat solvers
- heuristic function
- stochastic local search
- memetic algorithm
- hill climbing
- branch and bound
- random sat instances
- greedy search
- tree search
- constraint satisfaction
- initial solution
- genetic algorithm
- dynamic programming
- upper bound
- combinatorial problems
- lower bound
- simulated annealing and tabu search
- global search
- evolutionary algorithm
- solution quality
- systematic search
- iterated local search
- variable neighborhood descent