The min-max close-enough arc routing problem (Q2116901)
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 7493218
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The min-max close-enough arc routing problem |
scientific article; zbMATH DE number 7493218 |
Statements
The min-max close-enough arc routing problem (English)
0 references
18 March 2022
0 references
routing
0 references
close-enough arc routing problem
0 references
branch-and-price
0 references
branch-and-cut
0 references
min-max
0 references
0 references
0 references
0 references
0.94706285
0 references
0.94670904
0 references
0.9339082
0 references
0.93122065
0 references
0.9244932
0 references
0.91005206
0 references
0.9076591
0 references
0.9057811
0 references
0 references
