New approximation algorithms for the minimum cycle cover problem (Q5896084): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-78455-7_7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3140590674 / rank | |||
Normal rank | |||
Latest revision as of 00:27, 20 March 2024
scientific article; zbMATH DE number 7218090
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New approximation algorithms for the minimum cycle cover problem |
scientific article; zbMATH DE number 7218090 |
Statements
New approximation algorithms for the minimum cycle cover problem (English)
0 references
7 July 2020
0 references
vehicle routing
0 references
cycle cover
0 references
traveling salesman problem
0 references
approximation algorithm
0 references
