Deep clustering of the traveling salesman problem to parallelize its solution

Cites work

scientific article; zbMATH DE number 3177183 (Why is no real title available?)
scientific article; zbMATH DE number 1219584 (Why is no real title available?)
scientific article; zbMATH DE number 1297592 (Why is no real title available?)
scientific article; zbMATH DE number 2064407 (Why is no real title available?)
scientific article; zbMATH DE number 1556546 (Why is no real title available?)
scientific article; zbMATH DE number 1749221 (Why is no real title available?)
scientific article; zbMATH DE number 1926668 (Why is no real title available?)
scientific article; zbMATH DE number 3895002 (Why is no real title available?)
A Lagrangean-based heuristics for the target covering problem in wireless sensor network
A fresh look at the traveling salesman problem with a center
A large population size can be unhelpful in evolutionary algorithms
A parallel tabu search algorithm for large traveling salesman problems
A reinforced hybrid genetic algorithm for the traveling salesman problem
Algorithm AS 136: A K-Means Clustering Algorithm
Clustering to minimize the maximum intercluster distance
Combinatorial optimization -- Eureka, you shrink. Papers dedicated to Jack Edmonds. 5th international workshop, Aussois, France, March 5--9, 2001. Revised papers
Controller Parameters Optimization on a Representative Set of Systems Using Deterministic-Chaotic-Mutation Evolutionary Algorithms
Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule
Guidelines for the use of meta-heuristics in combinatorial optimization.
Heuristics from Nature for Hard Combinatorial Optimization Problems
Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows
Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming
Mersenne twister
Optimization in multimodal freight transportation problems: a survey
Random numbers and computers
Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem
Solution of large-scale symmetric travelling salesman problems
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
The elitist non-homogeneous genetic algorithm: almost sure convergence
The solution of some 100-city travelling salesman problems
Tight lower bounds for the traveling salesman problem with draft limits
Traveling salesman problem heuristics: leading methods, implementations and latest advances

This page was built for publication: Deep clustering of the traveling salesman problem to parallelize its solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561208)