Semi-preemptive routing on a linear and circular track

DOI10.1016/j.disopt.2009.01.001zbMath1167.90385OpenAlexW2081582672MaRDI QIDQ834179

Dirk Räbiger, Rainer Schrader

Publication date: 19 August 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2009.01.001

zbMATH Keywords

transportationdial-a-ridepickup and delivery

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (1)

Semi-preemptive routing on trees

Cites Work

• Semi-preemptive routing on trees
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Routing a vehicle of capacity greater than one
• Nonpreemptive Ensemble Motion Planning on a Tree
• Efficient algorithms for a family of matroid intersection problems
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• Preemptive Ensemble Motion Planning on a Tree

This page was built for publication: Semi-preemptive routing on a linear and circular track