Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms.
Nicolas BourgeoisBruno EscoffierVangelis Th. PaschosPublished in: WADS (2009)
Keyphrases
- combinatorial problems
- combinatorial optimization
- constraint programming
- constraint satisfaction
- solving hard
- computationally efficient
- constraint satisfaction problems
- metaheuristic
- traveling salesman problem
- phase transition
- computational complexity
- orders of magnitude
- evolutionary algorithm
- special case
- optimization problems
- error bounds