Backdoors to Combinatorial Optimization: Feasibility and Optimality.
Bistra DilkinaCarla P. GomesYuri MalitskyAshish SabharwalMeinolf SellmannPublished in: CPAIOR (2009)
Keyphrases
- combinatorial optimization
- metaheuristic
- combinatorial optimization problems
- traveling salesman problem
- simulated annealing
- branch and bound
- combinatorial problems
- branch and bound algorithm
- optimal solution
- mathematical programming
- hard combinatorial optimization problems
- optimization problems
- memetic algorithm
- hidden structure
- satisfiability problem
- sat solvers
- quadratic assignment problem
- combinatorial search
- vehicle routing problem
- benchmark problems
- search space
- lower bound
- sat instances
- genetic algorithm