The complexity of the travelling repairman problem (Q3709900)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3938572
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the travelling repairman problem |
scientific article; zbMATH DE number 3938572 |
Statements
The complexity of the travelling repairman problem (English)
0 references
1986
0 references
mean-flow variant of the travelling salesman problem
0 references
polynomial-time algorithm
0 references
NP-complete
0 references
0 references
0.91738516
0 references
0.90225613
0 references
0.9018153
0 references
0 references
0.8833569
0 references
0.8801166
0 references
0.8798632
0 references
