The time-dependent prize-collecting arc routing problem (Q340251)
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 6652531
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The time-dependent prize-collecting arc routing problem |
scientific article; zbMATH DE number 6652531 |
Statements
The time-dependent prize-collecting arc routing problem (English)
0 references
14 November 2016
0 references
prize-collecting
0 references
arc routing
0 references
time-dependent
0 references
full truck load
0 references
0.8418344855308533
0 references
0.8067337870597839
0 references
0.805142343044281
0 references
0.8048394322395325
0 references
0.7977580428123474
0 references
