Sometimes Travelling is Easy: The Master Tour Problem (Q4388980)
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: Sometimes Travelling is Easy: The Master Tour Problem |
scientific article; zbMATH DE number 1150884
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sometimes Travelling is Easy: The Master Tour Problem |
scientific article; zbMATH DE number 1150884 |
Statements
Sometimes Travelling is Easy: The Master Tour Problem (English)
0 references
11 May 1998
0 references
travelling salesman problem
0 references
Kalmanson condition
0 references
master tour
0 references
combinatorial optimization
0 references
polynomial time
0 references
0.996570885181427
0 references
0.8161724209785461
0 references
0.7746198773384094
0 references
0.7689468860626221
0 references
