Generalized traveling salesman problem reduction algorithms
From MaRDI portal
Recommendations
- Approximation schemes for the generalized traveling salesman problem
- scientific article; zbMATH DE number 3848953
- Some Applications of the Generalized Travelling Salesman Problem
- On Some Generalizations of the Travelling-Salesman Problem
- An Efficient Transformation Of The Generalized Traveling Salesman Problem
- A new generalization of the traveling salesman problem
- Approximation algorithms for the traveling salesman problem
- scientific article; zbMATH DE number 16721
Cited in
(12)- A comprehensive survey on the generalized traveling salesman problem
- The set team orienteering problem
- Reducing Path TSP to TSP
- Analysis of a high-performance TSP solver on the GPU
- An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
- Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
- A novel discretization scheme for the close enough traveling salesman problem
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
- Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
- A biased random-key genetic algorithm for the set orienteering problem
This page was built for publication: Generalized traveling salesman problem reduction algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867371)