On the Traveling Salesman Problem with a Relaxed Monge Matrix.
Rainer E. BurkardVladimir G. DeinekoPublished in: Inf. Process. Lett. (1998)
Keyphrases
- traveling salesman problem
- ant colony optimization
- optimization problems
- combinatorial optimization
- combinatorial optimization problems
- traveling salesman
- combinatorial problems
- vehicle routing problem
- hamiltonian cycle
- discrete optimization problems
- discrete particle swarm optimization
- transportation networks
- ant colony optimization algorithm
- genetic local search
- crossover operator
- valid inequalities
- swarm intelligence
- scheduling problem
- lower bound