A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem (Q4367232)

From MaRDI portal
Revision as of 15:39, 28 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1091516
Language Label Description Also known as
English
A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
scientific article; zbMATH DE number 1091516

    Statements

    A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem (English)
    0 references
    0 references
    0 references
    1 September 1998
    0 references
    clustered notes
    0 references
    symmetric traveling salesman
    0 references
    generalized traveling salesman
    0 references
    location-routing
    0 references
    integer linear program
    0 references
    facial structure
    0 references
    polytopes
    0 references
    heuristic separation procedures
    0 references
    branch-and-cut
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references