DARCLASS
From MaRDI portal
Software:18329
No author found.
Related Items (18)
Computer-Aided Complexity Classification of Dial-a-Ride Problems ⋮ Solving the traveling repairman problem on a line with general processing times and deadlines ⋮ Finding optimal tour schedules on transportation paths under extended time window constraints ⋮ The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail ⋮ Unnamed Item ⋮ From theory to practice: maximizing revenues for on-line dial-a-ride ⋮ Emergency path restoration problems ⋮ Crane scheduling in railway yards: an analysis of computational complexity ⋮ Improved bounds for open online dial-a-ride on the line ⋮ Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line ⋮ A reduction approach to the two-campus transport problem ⋮ Profit-based latency problems on the line ⋮ Tree optimization based heuristics and metaheuristics in network construction problems ⋮ On-line single-server dial-a-ride problems ⋮ Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios ⋮ Approximation and Online Algorithms ⋮ Vehicle routing problems on a line-shaped network with release time constraints ⋮ Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios
This page was built for software: DARCLASS
