The complexity of the travelling repairman problem (Q3709900): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W80909727 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: P-Complete Approximation Problems / rank | |||
Normal rank | |||
Latest revision as of 11:52, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the travelling repairman problem |
scientific article |
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
