A note on computational aspects of the Steiner traveling salesman problem.
Eduardo Álvarez-MirandaMarkus SinnlPublished in: Int. Trans. Oper. Res. (2019)
Keyphrases
- traveling salesman problem
- minimum spanning tree
- combinatorial optimization
- ant colony optimization
- combinatorial problems
- ant colony optimization algorithm
- optimization problems
- traveling salesman
- crossover operator
- transportation networks
- hamiltonian cycle
- discrete particle swarm optimization
- valid inequalities
- vehicle routing problem
- genetic local search
- discrete optimization problems
- nature inspired
- combinatorial optimization problems
- message passing
- simulated annealing
- neural network