Efficient Algorithms for Combinatorial Problems with Bounded Decomposability - A Survey.
Stefan ArnborgPublished in: BIT (1985)
Keyphrases
- combinatorial problems
- constraint programming
- combinatorial optimization
- metaheuristic
- constraint satisfaction problems
- constraint satisfaction
- graph coloring
- traveling salesman problem
- phase transition
- solving hard
- branch and bound algorithm
- graph colouring
- global constraints
- hard combinatorial optimization problems
- ant colony optimization
- simulated annealing
- specific problems
- constraint propagation
- orders of magnitude
- combinatorial search
- sat encodings
- optimal solution
- neural network