A Heuristic Approach for Cluster TSP
From MaRDI portal
Publication:3297279
DOI10.1007/978-3-030-34152-7_4zbMath1436.90126OpenAlexW3004749376MaRDI QIDQ3297279
Apurba Manna, Arindam Roy, Samir Maity
Publication date: 3 July 2020
Published in: Recent Advances in Intelligent Information Systems and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-34152-7_4
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
- An exact algorithm for the clustered travelling salesman problem
- Procedures for travelling salesman problems with additional constraints
- Metaheuristics for the tabu clustered traveling salesman problem
- The traveling salesman problem with backhauls
- TSPLIB—A Traveling Salesman Problem Library
- Some applications of the clustered travelling salesman problem
This page was built for publication: A Heuristic Approach for Cluster TSP
