Critical graphs, matching and tours or a hierarchy of relaxations for the traveling salesman problem.
Gérard CornuéjolsWilliam R. PulleyblankPublished in: Comb. (1983)
Keyphrases
- traveling salesman problem
- graph matching
- hamiltonian cycle
- combinatorial optimization
- transportation networks
- minimum spanning tree
- ant colony optimization
- optimization problems
- combinatorial problems
- matching algorithm
- traveling salesman
- vehicle routing problem
- discrete optimization problems
- ant colony optimization algorithm
- combinatorial optimization problems
- valid inequalities
- graph theory
- discrete particle swarm optimization
- np hard
- neural network
- genetic local search
- bipartite graph
- search algorithm