DARCLASS
From MaRDI portal
Cited in
(18)- Computer-aided complexity classification of dial-a-ride problems
- Approximation and Online Algorithms
- On-line single-server dial-a-ride problems
- Emergency path restoration problems
- Solving the traveling repairman problem on a line with general processing times and deadlines
- Tree optimization based heuristics and metaheuristics in network construction problems
- Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios
- Profit-based latency problems on the line
- scientific article; zbMATH DE number 7650088 (Why is no real title available?)
- Finding optimal tour schedules on transportation paths under extended time window constraints
- Vehicle routing problems on a line-shaped network with release time constraints
- A reduction approach to the two-campus transport problem
- Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios
- 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
- Improved bounds for open online dial-a-ride on the line
- Crane scheduling in railway yards: an analysis of computational complexity
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
This page was built for software: DARCLASS
