A dynamic tree algorithm for peer-to-peer ridesharing matching (Q2129373)
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: A dynamic tree algorithm for peer-to-peer ridesharing matching |
scientific article; zbMATH DE number 7512400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dynamic tree algorithm for peer-to-peer ridesharing matching |
scientific article; zbMATH DE number 7512400 |
Statements
A dynamic tree algorithm for peer-to-peer ridesharing matching (English)
0 references
22 April 2022
0 references
dynamic tree
0 references
peer-to-peer ridesharing
0 references
matching
0 references
vehicle routing problem
0 references
0 references
0 references
0 references
0 references
0.7764559388160706
0 references
0.7580807209014893
0 references
0.752595841884613
0 references
0.7484040856361389
0 references
0.7483687400817871
0 references
