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

From MaRDI portal
Revision as of 01:41, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(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
    0 references
    1988
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    modified traveling salesman
    0 references
    zero-one linear program
    0 references
    polynomial time
    0 references
    branch-and-cut
    0 references
    0 references