Embedding Relaxations in Global Constraints for Solving TSP and TSPTW.
Filippo FocacciAndrea LodiMichela MilanoPublished in: Ann. Math. Artif. Intell. (2002)
Keyphrases
- global constraints
- lp relaxation
- constraint programming
- combinatorial optimization
- traveling salesman problem
- constraint satisfaction problems
- np hard
- boolean constraints
- parameterized complexity
- weighted constraint satisfaction
- lower bound
- symmetry breaking
- arc consistency
- linear programming
- semidefinite
- genetic algorithm
- dynamic programming
- special case
- search space