Preemptive Ensemble Motion Planning on a Tree

DOI10.1137/0221066zbMath0760.68033OpenAlexW1985351788MaRDI QIDQ4027858

No author found.

Publication date: 9 March 1993

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1735&context=cstech

zbMATH Keywords

vehicle routingmotion planningpreemptiondirected minimum spanning tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (17)

Tree based heuristics for the preemptive asymmetric stacker crane problem ⋮ Approximation algorithms for distance constrained vehicle routing problems ⋮ Semi-preemptive routing on a linear and circular track ⋮ Serving requests with on-line routing ⋮ Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem ⋮ How to sort by walking and swapping on paths and trees ⋮ Routing a vehicle of capacity greater than one ⋮ A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles ⋮ Models for the single-vehicle preemptive pickup and delivery problem ⋮ Preemptive stacker crane problem: extending tree-based properties and construction heuristics ⋮ On-line single-server dial-a-ride problems ⋮ Heuristics for the mixed swapping problem ⋮ Semi-preemptive routing on trees ⋮ The preemptive swapping problem on a tree ⋮ Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks

This page was built for publication: Preemptive Ensemble Motion Planning on a Tree