Routing by ranking: a link analysis method for the constrained dial-a-ride problem (Q2450754)
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: Routing by ranking: a link analysis method for the constrained dial-a-ride problem |
scientific article; zbMATH DE number 6295935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Routing by ranking: a link analysis method for the constrained dial-a-ride problem |
scientific article; zbMATH DE number 6295935 |
Statements
Routing by ranking: a link analysis method for the constrained dial-a-ride problem (English)
0 references
15 May 2014
0 references
dial-a-ride problem
0 references
link analysis
0 references
hits
0 references
topological ordering
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.797518789768219
0 references
0.7776721119880676
0 references
0.7719521522521973
0 references
0.7663736939430237
0 references
0.7552686929702759
0 references
