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 this page instead for the normal view: A matheuristic for the distance-constrained close-enough arc routing problem |
scientific article; zbMATH DE number 7079040
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
