Computer-Aided Complexity Classification of Dial-a-Ride Problems
From MaRDI portal
Publication:2890414
DOI10.1287/ijoc.1030.0052zbMath1239.90048OpenAlexW2168563161MaRDI QIDQ2890414
Jiří Sgall, Willem E. de Paepe, R. A. Sitters, Jan Karel Lenstra, Leen Stougie
Publication date: 8 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1030.0052
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (21)
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 ⋮ Network construction/restoration problems: cycles and complexity ⋮ 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 ⋮ 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 ⋮ Unnamed Item ⋮ 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 ⋮ 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
Uses Software
This page was built for publication: Computer-Aided Complexity Classification of Dial-a-Ride Problems
