A parallel tabu search algorithm for large traveling salesman problems (Q1329785)

From MaRDI portal
Revision as of 22:50, 2 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127908973, #quickstatements; #temporary_batch_1722635374576)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A parallel tabu search algorithm for large traveling salesman problems
scientific article

    Statements

    title
    A parallel tabu search algorithm for large traveling salesman problems (English)
    0 references
    publication date
    21 June 2000
    0 references

    Identifiers

    zbMATH DE Number
    612411
    0 references
    OpenAlex ID
    W2095546721
    0 references
    Wikidata QID
    Q127908973
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1329785&oldid=37560845"
    Powered by MediaWiki