The following pages link to DARCLASS (Q18329):
Displaying 18 items.
- Solving the traveling repairman problem on a line with general processing times and deadlines (Q319440) (← links)
- Finding optimal tour schedules on transportation paths under extended time window constraints (Q341462) (← links)
- Emergency path restoration problems (Q435733) (← links)
- A reduction approach to the two-campus transport problem (Q490382) (← links)
- Profit-based latency problems on the line (Q943793) (← links)
- Vehicle routing problems on a line-shaped network with release time constraints (Q1015302) (← links)
- The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail (Q1691943) (← links)
- From theory to practice: maximizing revenues for on-line dial-a-ride (Q1702834) (← links)
- Crane scheduling in railway yards: an analysis of computational complexity (Q1707828) (← links)
- Tree optimization based heuristics and metaheuristics in network construction problems (Q2027081) (← links)
- Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios (Q2294628) (← links)
- Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios (Q2329723) (← links)
- Improved bounds for open online dial-a-ride on the line (Q2701389) (← links)
- Computer-Aided Complexity Classification of Dial-a-Ride Problems (Q2890414) (← links)
- Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line (Q3300763) (← links)
- (Q5875473) (← links)
- Approximation and Online Algorithms (Q5898478) (← links)
- On-line single-server dial-a-ride problems (Q5958715) (← links)
