Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems
From MaRDI portal
Publication:6040633
DOI10.1016/j.tcs.2023.113923OpenAlexW4367673886MaRDI QIDQ6040633
Clément Dallard, Janka Chlebíková, Niklas Paulsen
Publication date: 19 May 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113923
Cites Work
- Unnamed Item
- Unnamed Item
- On the algorithmic effectiveness of digraph decompositions and complexity measures
- A note on ``Efficient feasibility testing for dial-a-ride problems
- Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
- Edge-disjoint spanning trees and depth-first search
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
- Complexity of scheduling for DARP with soft ride times
- Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
- Maximum directed cuts in acyclic digraphs
- Timing problems and algorithms: Time decisions for sequences of activities
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems
