Branch-and-cut approach to a variant of the traveling salesman problem (Q3812063)

From MaRDI portal
Revision as of 12:11, 19 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Branch-and-cut approach to a variant of the traveling salesman problem
scientific article

    Statements

    Branch-and-cut approach to a variant of the traveling salesman problem (English)
    0 references
    0 references
    0 references
    1988
    0 references
    modified traveling salesman
    0 references
    zero-one linear program
    0 references
    polynomial time
    0 references
    branch-and-cut
    0 references

    Identifiers

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