A new upper bound for the traveling salesman problem in cubic graphs.
Maciej LiskiewiczMartin R. SchusterPublished in: J. Discrete Algorithms (2014)
Keyphrases
- traveling salesman problem
- upper bound
- hamiltonian cycle
- lower bound
- minimum spanning tree
- combinatorial optimization
- transportation networks
- ant colony optimization
- combinatorial problems
- combinatorial optimization problems
- lower and upper bounds
- optimization problems
- ant colony optimization algorithm
- branch and bound algorithm
- branch and bound
- discrete optimization problems
- vehicle routing problem
- graph theory
- discrete particle swarm optimization
- worst case
- directed graph
- crossover operator
- traveling salesman
- valid inequalities
- genetic algorithm
- subtour elimination
- graph matching
- dynamic programming
- weighted graph
- branch and bound method
- energy minimization
- markov decision processes
- particle swarm optimization
- search algorithm