On the fast delivery problem with one or two packages (Q2208259)
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 7265478
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the fast delivery problem with one or two packages |
scientific article; zbMATH DE number 7265478 |
Statements
On the fast delivery problem with one or two packages (English)
0 references
23 October 2020
0 references
mobile agents
0 references
Dijkstra's algorithm
0 references
polynomial-time algorithm
0 references
time-dependent shortest paths
0 references
NP-hardness
0 references
0 references
0.9286693930625916
0 references
0.8745840787887573
0 references
0.8564645051956177
0 references
0.7862094044685364
0 references
