The Stochastic Close-Enough Arc Routing Problem (Q4565785)
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 6887381
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Stochastic Close-Enough Arc Routing Problem |
scientific article; zbMATH DE number 6887381 |
Statements
The stochastic close-enough arc routing problem (English)
0 references
13 June 2018
0 references
Stochastic Close-Enough Arc Routing Problem
0 references
automated meter reading
0 references
radio frequency identification
0 references
cutting planes
0 references
0.8443109393119812
0 references
0.8193327188491821
0 references
0.8012279272079468
0 references
0.8003796935081482
0 references
0.7666640877723694
0 references
