Solving the clustered traveling salesman problem with ‐relaxed priority rule (Q6070874)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7770681
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the clustered traveling salesman problem with ‐relaxed priority rule |
scientific article; zbMATH DE number 7770681 |
Statements
Solving the clustered traveling salesman problem with ‐relaxed priority rule (English)
0 references
24 November 2023
0 references
clustered traveling salesman problem
0 references
\(d\)-relaxed priority rule
0 references
mixed integer programming
0 references
iterated local search
0 references
0 references
