Online pickup and delivery problem with constrained capacity to minimize latency (Q2156283)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Online pickup and delivery problem with constrained capacity to minimize latency |
scientific article; zbMATH DE number 7558375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online pickup and delivery problem with constrained capacity to minimize latency |
scientific article; zbMATH DE number 7558375 |
Statements
Online pickup and delivery problem with constrained capacity to minimize latency (English)
0 references
18 July 2022
0 references
online
0 references
pickup
0 references
delivery
0 references
latency
0 references
competitive analysis
0 references
0.7581264972686768
0 references
0.7298793196678162
0 references
0.7180203795433044
0 references
0.7168497443199158
0 references
