Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem (Q5331678): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q56019908, #quickstatements; #temporary_batch_1712201099914 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56019908 / rank | |||
Normal rank | |||
Revision as of 19:58, 4 April 2024
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
1964
0 references
operations research
0 references
