Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (Q704117)

From MaRDI portal
Revision as of 10:54, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem
scientific article

    Statements

    Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (English)
    0 references
    0 references
    0 references
    0 references
    12 January 2005
    0 references
    Peripatetic Salesman Problem
    0 references
    Traveling Salesman Problem
    0 references
    Branch-and-cut
    0 references

    Identifiers