Semi–preemptive routing on a line

DOI10.1016/J.ENDM.2004.03.046zbMath1125.90317OpenAlexW1976414464MaRDI QIDQ3439160

Dirk Räbiger

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2004.03.046

zbMATH Keywords

dial-a-ridepickup and delivery

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Semi-preemptive routing on trees

Cites Work

• Routing a vehicle of capacity greater than one
• Efficient algorithms for a family of matroid intersection problems
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel

This page was built for publication: Semi–preemptive routing on a line