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

From MaRDI portal
Revision as of 11:36, 16 August 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
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