Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623)

From MaRDI portal
Revision as of 00:04, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
scientific article

    Statements

    Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (English)
    0 references
    0 references
    0 references
    12 July 2018
    0 references
    generalized multiple depot traveling salesmen
    0 references
    routing
    0 references
    branch-and-cut
    0 references
    polyhedral study
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references