Solving the clustered traveling salesman problem with ‐relaxed priority rule (Q6070874): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1111/itor.12797 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1111/ITOR.12797 / rank | |||
Normal rank | |||
Latest revision as of 19:09, 30 December 2024
scientific article; zbMATH DE number 7770681
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
