Routing by ranking: a link analysis method for the constrained dial-a-ride problem (Q2450754): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: VRPH / rank | |||
Normal rank | |||
Revision as of 00:55, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Routing by ranking: a link analysis method for the constrained dial-a-ride problem |
scientific article |
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
