An improved approximation algorithm for the clustered traveling salesman problem (Q456175): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6098111 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
traveling salesman problem | |||
| Property / zbMATH Keywords: traveling salesman problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
clustered traveling salesman problem | |||
| Property / zbMATH Keywords: clustered traveling salesman problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
approximation algorithm | |||
| Property / zbMATH Keywords: approximation algorithm / rank | |||
Normal rank | |||
Revision as of 11:39, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved approximation algorithm for the clustered traveling salesman problem |
scientific article |
Statements
An improved approximation algorithm for the clustered traveling salesman problem (English)
0 references
23 October 2012
0 references
traveling salesman problem
0 references
clustered traveling salesman problem
0 references
approximation algorithm
0 references
