The profitable close-enough arc routing problem (Q2669779)
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 7486427
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The profitable close-enough arc routing problem |
scientific article; zbMATH DE number 7486427 |
Statements
The profitable close-enough arc routing problem (English)
0 references
9 March 2022
0 references
arc routing
0 references
close-enough
0 references
profits
0 references
branch and cut
0 references
polyhedra
0 references
0 references
0 references
0 references
0 references
0 references
0.8720431923866272
0 references
0.8359130620956421
0 references
0.8065764904022217
0 references
0.8005858063697815
0 references
