Computer-aided complexity classification of dial-a-ride problems
From MaRDI portal
Recommendations
Cited in
(27)- Vehicle routing problems on a line-shaped network with release time constraints
- The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail
- From theory to practice: maximizing revenues for on-line dial-a-ride
- Crane scheduling in railway yards: an analysis of computational complexity
- Tree optimization based heuristics and metaheuristics in network construction problems
- The complexity of the unit stop number problem and its implications to other related problems
- Network construction/restoration problems: cycles and complexity
- Complexity of scheduling for DARP with soft ride times
- Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios
- Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios
- Improved bounds for open online dial-a-ride on the line
- Solving the traveling repairman problem on a line with general processing times and deadlines
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
- Finding optimal tour schedules on transportation paths under extended time window constraints
- Emergency path restoration problems
- A reduction approach to the two-campus transport problem
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
- scientific article; zbMATH DE number 7650088 (Why is no real title available?)
- On-line single-server dial-a-ride problems
- Complexity of inventory routing problems when routing is easy
- Graph representation of the fixed route dial-a-ride problem
- Algorithms for online car-sharing problem
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
- Vehicle routing for connected service areas -- a versatile approach covering single, hierarchical, and bi-criteria objectives
- Traveling repairperson, unrelated machines, and other stories about average completion times
- A hard dial-a-ride problem that is easy on average
- Profit-based latency problems on the line
This page was built for publication: Computer-aided complexity classification of dial-a-ride problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890414)
