A new upper bound for the traveling salesman problem in cubic graphs.
Maciej LiskiewiczMartin R. SchusterPublished in: CTW (2013)
Keyphrases
- traveling salesman problem
- upper bound
- hamiltonian cycle
- minimum spanning tree
- lower bound
- transportation networks
- combinatorial optimization
- combinatorial problems
- worst case
- ant colony optimization
- branch and bound algorithm
- optimization problems
- traveling salesman
- ant colony optimization algorithm
- valid inequalities
- vehicle routing problem
- lower and upper bounds
- crossover operator
- discrete optimization problems
- genetic local search
- graph theory
- graph matching
- combinatorial optimization problems
- spanning tree
- graph structure
- branch and bound
- discrete particle swarm optimization
- objective function
- bipartite graph
- directed graph
- evolutionary algorithm