Two Algorithmic Results for the Traveling Salesman Problem (Q4880877): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1287/moor.21.1.65 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MOOR.21.1.65 / rank | |||
Normal rank | |||
Latest revision as of 15:19, 30 December 2024
scientific article; zbMATH DE number 892141
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two Algorithmic Results for the Traveling Salesman Problem |
scientific article; zbMATH DE number 892141 |
Statements
Two Algorithmic Results for the Traveling Salesman Problem (English)
0 references
3 October 1996
0 references
polynomial time algorithm
0 references
Hamiltonian circuit
0 references
permanent of a matrix
0 references
