Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model

From MaRDI portal

Revision as of 04:07, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5434379

Jump to:navigation, search

DOI10.1007/11775096_4zbMath1137.90435OpenAlexW2114948449MaRDI QIDQ5434379

Chunlin Xin, Fanglei Yi, Yin-Feng Xu

Publication date: 4 January 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11775096_4

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (6)

Unnamed Item ⋮ 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 ⋮ Earliest deadline first is a 2-approximation for DARP with time windows

This page was built for publication: Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5434379&oldid=20195229"