FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4385348864 / rank | |||
Normal rank | |||
Revision as of 08:25, 30 July 2024
scientific article; zbMATH DE number 7746234
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM |
scientific article; zbMATH DE number 7746234 |
Statements
FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (English)
0 references
5 October 2023
0 references
prize-collecting traveling salesman problem
0 references
triangle inequality
0 references
approximation algorithm
0 references
fixed approximation ratio
0 references
