Complexity and approximation for Traveling Salesman Problems with profits.
Enrico AngelelliCristina BazganMaria Grazia SperanzaZsolt TuzaPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- traveling salesman problem
- approximation error
- satisfy the triangle inequality
- combinatorial optimization
- hamiltonian cycle
- optimization problems
- combinatorial problems
- combinatorial optimization problems
- ant colony optimization
- approximation algorithms
- distribution network
- computational complexity
- worst case
- traveling salesman
- reinforcement learning
- closed form
- random walk
- discrete optimization problems