An approximation algorithm for the clustered path travelling salesman problem (Q6039533)

From MaRDI portal
Revision as of 15:53, 25 April 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7682619
Language Label Description Also known as
English
An approximation algorithm for the clustered path travelling salesman problem
scientific article; zbMATH DE number 7682619

    Statements

    An approximation algorithm for the clustered path travelling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 May 2023
    0 references
    travelling salesman problem
    0 references
    stacker crane problem
    0 references
    path
    0 references
    cluster
    0 references

    Identifiers