On Limitations of Transformations Between Combinatorial Problems.
William SloughKarl WinklmannPublished in: Math. Syst. Theory (1991)
Keyphrases
- combinatorial problems
- constraint programming
- metaheuristic
- constraint satisfaction problems
- combinatorial optimization
- traveling salesman problem
- graph coloring
- constraint satisfaction
- phase transition
- solving hard
- branch and bound algorithm
- graph colouring
- hard combinatorial optimization problems
- global constraints
- specific problems
- constraint propagation
- branch and bound
- lower bound
- constraint solvers
- maximum satisfiability
- optimization problems