A branch-and-cut algorithm for the balanced traveling salesman problem.
Thi Quynh Trang VoMourad BaïouViet Hung NguyenPublished in: J. Comb. Optim. (2024)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- dynamic programming
- hamiltonian cycle
- computational complexity
- np hard
- optimization algorithm
- optimal solution
- objective function
- cost function
- integer programming
- traveling salesman
- discrete particle swarm optimization
- benchmark problems
- minimum spanning tree
- ant colony optimization algorithm
- similarity measure