On-line dial-a-ride problems under a restricted information model
From MaRDI portal
Publication:1884776
DOI10.1007/s00453-004-1116-zzbMath1070.90072OpenAlexW2135307460MaRDI QIDQ1884776
Willem E. de Paepe, Maarten Lipmann, Xi-wen Lu, Leen Stougie, R. A. Sitters
Publication date: 5 November 2004
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/a776182d-85bc-40f2-a9d4-4df5ef2a7bc7
Related Items (9)
Online \(k\)-server routing problems ⋮ Tight analysis of the lazy algorithm for open online dial-a-ride ⋮ Unnamed Item ⋮ An improved algorithm for open online dial-a-ride ⋮ Typology and literature review for dial-a-ride problems ⋮ 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 ⋮ Unnamed Item ⋮ Dynamic pickup and delivery problems
This page was built for publication: On-line dial-a-ride problems under a restricted information model
