Additional Results and Extensions for the paper "Probabilistic bounds on the k-Traveling Salesman Problem and the Traveling Repairman Problem".
Moïse BlanchardAlexandre JacquillatPatrick JailletPublished in: CoRR (2022)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- upper bound
- combinatorial problems
- hamiltonian cycle
- lower bound
- optimization problems
- discrete particle swarm optimization
- combinatorial optimization problems
- traveling salesman
- ant colony optimization algorithm
- transportation networks
- bayesian networks
- crossover operator
- probabilistic model
- genetic local search
- valid inequalities
- neural network
- vehicle routing problem
- discrete optimization problems
- lower and upper bounds
- graphical models