Solving the clustered traveling salesman problem with ‐relaxed priority rule (Q6070874)

From MaRDI portal
Revision as of 18:09, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers