Unruly codes with unruly distances raise (combinatorial) problems.
Giuseppe LongoAndrea SgarroPublished in: Electron. Notes Discret. Math. (2011)
Keyphrases
- combinatorial problems
- constraint programming
- constraint satisfaction problems
- constraint satisfaction
- graph coloring
- combinatorial optimization
- metaheuristic
- phase transition
- traveling salesman problem
- branch and bound algorithm
- solving hard
- hard combinatorial optimization problems
- graph colouring
- distance measure
- combinatorial search
- global constraints
- upper bound
- branch and bound
- genetic algorithm
- cost function