A bound for the symmetric travelling salesman problem through matroid formulation (Q1388823)

From MaRDI portal
Revision as of 12:38, 20 July 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
A bound for the symmetric travelling salesman problem through matroid formulation
scientific article

    Statements

    A bound for the symmetric travelling salesman problem through matroid formulation (English)
    0 references
    0 references
    0 references
    27 January 1999
    0 references
    0 references
    bound
    0 references
    symmetric traveling salesman
    0 references
    matroid
    0 references