Alternative Filtering for the Weighted Circuit Constraint: Comparing Lower Bounds for the TSP and Solving TSPTW.
Sylvain DucommanHadrien CambazardBernard PenzPublished in: AAAI (2016)
Keyphrases
- lower bound
- combinatorial optimization
- upper bound
- np hard
- traveling salesman problem
- branch and bound
- high speed
- optimal solution
- exact solution
- genetic algorithm
- objective function
- finite domain
- constrained problems
- lower and upper bounds
- vc dimension
- branch and bound algorithm
- digital circuits
- optimization problems
- electronic circuits
- travelling salesman
- weighted graph
- knapsack problem
- ant colony optimization
- quadratic assignment problem
- constraint problems
- metaheuristic
- finding optimal solutions