A note on approximation algorithms of the clustered traveling salesman problem (Q2398506): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2017.07.003 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2734875663 / rank | |||
Normal rank |
Revision as of 00:49, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on approximation algorithms of the clustered traveling salesman problem |
scientific article |
Statements
A note on approximation algorithms of the clustered traveling salesman problem (English)
0 references
16 August 2017
0 references
traveling salesman problem
0 references
clustered traveling salesman problem
0 references
approximation algorithms
0 references