Computing compatible tours for the symmetric traveling salesman problem (Q542055)

From MaRDI portal
Revision as of 20:38, 22 June 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
Computing compatible tours for the symmetric traveling salesman problem
scientific article

    Statements

    Computing compatible tours for the symmetric traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 June 2011
    0 references

    Identifiers