On the distance-constrained close enough arc routing problem (Q2029943)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7355327
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the distance-constrained close enough arc routing problem |
scientific article; zbMATH DE number 7355327 |
Statements
On the distance-constrained close enough arc routing problem (English)
0 references
4 June 2021
0 references
routing
0 references
distance constraints
0 references
close-enough
0 references
rural postman
0 references
branch and cut
0 references
0 references
0 references
0 references
0.9577573537826538
0 references
0.9150373339653016
0 references
0.8842628002166748
0 references
0.882777214050293
0 references
0.8359130620956421
0 references
