The Complexity of Combinatorial Problems with Succinct Input Representation.
Klaus W. WagnerPublished in: Acta Informatica (1986)
Keyphrases
- combinatorial problems
- constraint programming
- combinatorial optimization
- traveling salesman problem
- graph coloring
- metaheuristic
- constraint satisfaction problems
- constraint satisfaction
- solving hard
- graph colouring
- branch and bound algorithm
- phase transition
- combinatorial search
- worst case
- computational complexity
- constraint propagation
- neural network
- hard combinatorial optimization problems