Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh (Q631208): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2747613 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient feasibility testing for dial-a-ride problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on ``Efficient feasibility testing for dial-a-ride problems'' / rank | |||
Normal rank | |||
Latest revision as of 22:16, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh |
scientific article |
Statements
Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh (English)
0 references
22 March 2011
0 references
dial-a-ride
0 references
feasibility check
0 references
shortest path
0 references
difference constraint system
0 references
0 references
