Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
From MaRDI portal
Publication:2294592
Recommendations
- Approximation schemes for the generalized traveling salesman problem
- Approximation algorithms for generalized MST and TSP in grid clusters
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- On the complexity of approximating TSP with neighborhoods and related problems
- On the complexity of approximating TSP with neighborhoods and related problems
Cites work
- scientific article; zbMATH DE number 1219611 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A PTAS for TSP with neighborhoods among fat regions in the plane
- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
- APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS
- An exact algorithm with linear complexity for a problem of visiting megalopolises
- Approximability of the minimum-weight \(k\)-size cycle cover 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
- Approximation schemes for the generalized traveling salesman problem
- Bounds and Heuristics for Capacitated Routing Problems
- Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets
- Generalized pyramidal tours for the generalized traveling salesman problem
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
- New classes of efficiently solvable generalized traveling salesman problems
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- The Euclidean traveling salesman problem is NP-complete
- The geometric generalized minimum spanning tree problem with grid clustering
- The traveling salesman problem and its variations.
- The traveling salesman problem for lines, balls, and planes
Cited in
(8)- 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
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
- Parameter tuning of continuous Hopfield network applied to combinatorial optimization
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem
- Approximation schemes for the generalized traveling salesman problem
- A novel algorithm for construction of the shortest path between a finite set of nonintersecting contours on the plane
- Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms
This page was built for publication: Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294592)
