Approximation schemes for the generalized traveling salesman problem
From MaRDI portal
(Redirected from Publication:1744982)
Recommendations
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- scientific article; zbMATH DE number 1302021
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Approximation algorithms for generalized MST and TSP in grid clusters
Cites work
- scientific article; zbMATH DE number 3298367 (Why is no real title available?)
- scientific article; zbMATH DE number 3335671 (Why is no real title available?)
- A Dynamic Programming Approach to Sequencing Problems
- A PTAS for TSP with neighborhoods among fat regions in the plane
- A memetic algorithm for the generalized traveling salesman problem
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
- Approximation algorithms for TSP with neighborhoods in the plane
- Approximation algorithms for generalized MST and TSP in grid clusters
- Approximation algorithms for the Geometric Covering Salesman Problem
- Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- On a bottleneck routing problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- The design of approximation algorithms
- The geometric generalized minimum spanning tree problem with grid clustering
- The traveling salesman problem for lines, balls, and planes
Cited in
(17)- Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem
- Reliable production process design problem: compact MILP model and ALNS-based primal heuristic
- scientific article; zbMATH DE number 1559543 (Why is no real title available?)
- Metaheuristics for the distance constrained generalized covering traveling salesman problem
- scientific article; zbMATH DE number 1839451 (Why is no real title available?)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
- The reduction of the Pareto set of a special structure in bicriteria discrete problems
- Multi-candidate carpooling routing problem and its approximation algorithms
- Dynamic programming in the routing problem: decomposition variant
- Approximation algorithms for generalized MST and TSP in grid clusters
- Generalized traveling salesman problem reduction algorithms
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
- A novel algorithm for construction of the shortest path between a finite set of nonintersecting contours on the plane
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- scientific article; zbMATH DE number 5158919 (Why is no real title available?)
- Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms
This page was built for publication: Approximation schemes for the generalized traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744982)
