Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem (Q5331678)

From MaRDI portal
Revision as of 19:58, 4 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56019908, #quickstatements; #temporary_batch_1712201099914)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3205819
Language Label Description Also known as
English
Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
scientific article; zbMATH DE number 3205819

    Statements

    Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem (English)
    0 references
    0 references
    0 references
    1964
    0 references
    operations research
    0 references

    Identifiers