The traveling salesman problem: new polynomial approximation algorithms and domination analysis (Q2780838)

From MaRDI portal
Revision as of 16:09, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The traveling salesman problem: new polynomial approximation algorithms and domination analysis
scientific article

    Statements

    The traveling salesman problem: new polynomial approximation algorithms and domination analysis (English)
    0 references
    0 references
    2001
    0 references
    0 references