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

From MaRDI portal
Revision as of 01:51, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references
    Peripatetic Salesman Problem
    0 references
    Traveling Salesman Problem
    0 references
    Branch-and-cut
    0 references
    0 references