A comparison of lower bounds for the symmetric circulant traveling salesman problem.
Etienne de KlerkCristian DobrePublished in: Discret. Appl. Math. (2011)
Keyphrases
- traveling salesman problem
- lower bound
- combinatorial optimization
- optimization problems
- ant colony optimization
- satisfy the triangle inequality
- discrete particle swarm optimization
- combinatorial problems
- combinatorial optimization problems
- hamiltonian cycle
- objective function
- upper bound
- branch and bound
- traveling salesman
- crossover operator
- branch and bound algorithm
- vehicle routing problem
- valid inequalities
- evolutionary algorithm
- discrete optimization
- lower and upper bounds
- lagrangian relaxation
- graph coloring
- np hard
- linear programming