Small and large TSP: Two polynomially solvable cases of the traveling salesman problem (Q1309942)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Small and large TSP: Two polynomially solvable cases of the traveling salesman problem |
scientific article; zbMATH DE number 474805
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Small and large TSP: Two polynomially solvable cases of the traveling salesman problem |
scientific article; zbMATH DE number 474805 |
Statements
Small and large TSP: Two polynomially solvable cases of the traveling salesman problem (English)
0 references
1993
0 references
polynomially solvable cases
0 references
traveling salesman
0 references
subtour elimination algorithm
0 references
recognition
0 references
machine schuduling
0 references
0 references
0 references
