A bound for the symmetric travelling salesman problem through matroid formulation (Q1388823): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank

Revision as of 17:46, 29 February 2024

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