Greedy-type resistance of combinatorial problems.
Gareth BendallFrançois MargotPublished in: Discret. Optim. (2006)
Keyphrases
- combinatorial problems
- constraint programming
- constraint satisfaction problems
- constraint satisfaction
- traveling salesman problem
- combinatorial optimization
- phase transition
- metaheuristic
- graph coloring
- solving hard
- greedy algorithm
- search algorithm
- combinatorial search
- search space
- hard combinatorial optimization problems
- graph colouring
- constraint propagation
- dynamic programming
- symmetry breaking
- orders of magnitude