A matheuristic for the distance-constrained close-enough arc routing problem (Q2001874)
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 7079040
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A matheuristic for the distance-constrained close-enough arc routing problem |
scientific article; zbMATH DE number 7079040 |
Statements
A matheuristic for the distance-constrained close-enough arc routing problem (English)
0 references
11 July 2019
0 references
close-enough arc routing problem
0 references
generalized directed rural postman problem
0 references
distance constraints
0 references
matheuristic
0 references
multi-start
0 references
0 references
0 references
0.9577573537826538
0 references
0.8826336860656738
0 references
0.8782504796981812
0 references
0.8328776359558105
0 references
0.8003796935081482
0 references
