Routing by ranking: a link analysis method for the constrained dial-a-ride problem (Q2450754): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2013.09.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029164359 / rank | |||
Normal rank | |||
Revision as of 23:32, 19 March 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
