Solving Combinatorial Problems with Regular Local Search Algorithms.
Ramón BéjarFelip ManyàPublished in: LPAR (1999)
Keyphrases
- combinatorial problems
- combinatorial search
- solving hard
- combinatorial optimization
- search algorithm
- graph coloring
- constraint programming
- pseudo boolean
- search problems
- metaheuristic
- traveling salesman problem
- constraint satisfaction problems
- phase transition
- constraint satisfaction
- constraint solvers
- branch and bound
- sat encodings
- search heuristics
- branch and bound algorithm
- satisfiability problem
- graph colouring
- optimization problems
- global constraints
- tabu search
- search methods
- hard combinatorial optimization problems
- constraint problems
- heuristic search
- search strategies
- ant colony optimization
- search tree
- systematic search
- search strategy
- specific problems
- genetic algorithm
- simulated annealing