Nonpreemptive Ensemble Motion Planning on a Tree

DOI10.1006/JAGM.1993.1029zbMath0784.68040OpenAlexW2075420967MaRDI QIDQ3141520

No author found.

Publication date: 6 December 1993

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cstech/735

zbMATH Keywords

treeNP-hardmotion planningapproximation algorithmsminimum-cost tour

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (21)

Tree based heuristics for the preemptive asymmetric stacker crane problem ⋮ Semi-preemptive routing on a linear and circular track ⋮ 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 hard dial-a-ride problem that is easy on average ⋮ The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail ⋮ Approximation algorithms for multi-vehicle stacker crane problems ⋮ Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system ⋮ GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY ⋮ Euler is standing in line dial-a-ride problems with precedence-constraints ⋮ 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 ⋮ Approximation algorithms for some min-max and minimum stacker crane cover problems ⋮ Approximation algorithms for some min-max and minimum stacker crane cover problems ⋮ The preemptive swapping problem on a tree ⋮ New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization

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