Deep clustering of the traveling salesman problem to parallelize its solution (Q6561208)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deep clustering of the traveling salesman problem to parallelize its solution |
scientific article; zbMATH DE number 7870669
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deep clustering of the traveling salesman problem to parallelize its solution |
scientific article; zbMATH DE number 7870669 |
Statements
Deep clustering of the traveling salesman problem to parallelize its solution (English)
0 references
25 June 2024
0 references
traveling salesman problem
0 references
clustered subproblems
0 references
deep clustering
0 references
parallelization
0 references
route length
0 references
genetic algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
