Minmax \(p\)-traveling salesmen location problems on a tree (Q1872012)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Minmax \(p\)-traveling salesmen location problems on a tree
scientific article

    Statements

    Minmax \(p\)-traveling salesmen location problems on a tree (English)
    0 references
    0 references
    0 references
    4 May 2003
    0 references
    0 references
    polynomial algorithm
    0 references
    location
    0 references
    traveling salesman problem
    0 references
    0 references