An Efficient Transformation Of The Generalized Traveling Salesman Problem
From MaRDI portal
Recommendations
- An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
- Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem
- Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
- Transformations of generalized ATSP into ATSP.
- Some Applications of the Generalized Travelling Salesman Problem
Cited in
(49)- A way to optimally solve a time-dependent vehicle routing problem with time windows
- An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
- On the generalized 2-peripatetic salesman problem
- Modeling and solving several classes of arc routing problems as traveling salesman problems
- Transformations of generalized ATSP into ATSP.
- Generalized spanning trees
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Dubins traveling salesman problem with neighborhoods: a graph-based approach
- Generalized network design problems.
- Routing problems: A bibliography
- An efficient transformation of the generalized vehicle routing problem
- Branch-and-bound for the precedence constrained generalized traveling salesman problem
- On shortest Dubins path via a circular boundary
- Dealing with time in the multiple traveling salespersons problem with moving targets
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
- Solving an urban waste collection problem using ants heuristics
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- A review of TSP based approaches for flowshop scheduling
- Generalized traveling salesman problem reduction algorithms
- Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem
- Some Applications of the Generalized Travelling Salesman Problem
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
- scientific article; zbMATH DE number 1933055 (Why is no real title available?)
- Directed in-out graphs of optimal size
- Exact solution of the generalized routing problem through graph transformations
- Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
- A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem
- A transformation for the mixed general routing problem with turn penalties
- Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
- A branch‐and‐dive heuristic for single vehicle snow removal
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
- Temperature field optimization for laser powder bed fusion as a traveling salesperson problem with history
- The single robot line coverage problem: Theory, algorithms, and experiments
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem
- Solving the large-scale min-max k-rural postman problem for snow plowing
- A comprehensive survey on the generalized traveling salesman problem
- A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
- A survey on the traveling salesman problem and its variants in a warehousing context
- Picker routing in scattered storage warehouses: an evaluation of solution methods based on TSP transformations
- The non-disjoint clustered traveling salesperson problem
- A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal
- A random-key genetic algorithm for the generalized traveling salesman problem
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
This page was built for publication: An Efficient Transformation Of The Generalized Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202256)
