Solving the close-enough arc routing problem (Q2811327)
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 6591808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the close-enough arc routing problem |
scientific article; zbMATH DE number 6591808 |
Statements
Solving the close-enough arc routing problem (English)
0 references
10 June 2016
0 references
close-enough arc routing problem
0 references
close-enough traveling salesman problem
0 references
automated meter Reading
0 references
radio frequency identification
0 references
branch-and-cut algorithm
0 references
0 references
0 references
0.9150373339653016
0 references
0.8826336860656738
0 references
0.8498994708061218
0 references
0.8443109393119812
0 references
