Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Introduction to algorithms
A note on "Efficient feasibility testing for dial-a-ride problems"
Operations Research Letters
Efficient feasibility testing for dial-a-ride problems
Operations Research Letters
| Hi-index | 0.00 |
Hunsaker and Savelsbergh [B. Hunsaker, M. Savelsbergh, Efficient feasibility testing for dial-a-ride problems, Operations Research Letters 30 (2002) 169-173] discussed feasibility testing for a dial-a-ride problem under maximum wait time and maximum ride time constraints. We show that this feasibility test can be expressed as a shortest path problem in vertex-weighted interval graphs, which leads to a simple linear time algorithm.