Traveling salesman problem with clustering
From MaRDI portal
Publication:616229
Recommendations
Cites work
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- A Study of Domino-Parity and k-Parity Constraints for the TSP
- A generalized insertion heuristic for the travelling salesman problem with time windows
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Guaranteed performance heuristics for the bottleneck traveling salesman problem
- Matching, Euler tours and the Chinese postman
- Moments of random walk with fixed end point
- On the neighborhood structure of the traveling salesman problem generated by local search moves
- Optimization by simulated annealing
- Optimization of production planning problems -- A case study for assembly lines
- Record breaking optimization results using the ruin and recreate principle
- Searching for Backbones—a high-performance parallel algorithm for solving combinatorial optimization problems
- Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem
- Some applications of the clustered travelling salesman problem
- Stochastic Optimization
- The landscape of the traveling salesman problem
- The time-dependent traveling salesman problem
- The traveling salesman problem and its variations.
- The traveling salesman problem. A computational study.
- The traveling salesman. Computational solutions for RSP applications
Cited in
(4)- IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
- Heuristics for a cash-collection routing problem with a cluster-first route-second approach
- Efficiency analysis of the vertex clustering in solving the traveling salesman problem
- Some applications of the clustered travelling salesman problem
This page was built for publication: Traveling salesman problem with clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616229)