Nonpreemptive Ensemble Motion Planning on a Tree
From MaRDI portal
Recommendations
Cited in
(31)- Semi-preemptive routing on trees
- Routing a vehicle of capacity greater than one
- New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
- The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail
- Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system
- Preemptive stacker crane problem: extending tree-based properties and construction heuristics
- How to sort by walking and swapping on paths and trees
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Approximation algorithms for multi-vehicle stacker crane problems
- Generalisations of the Gilmore-Gomory traveling salesman problem and the Gilmore-Gomory scheme: a survey
- Tree based heuristics for the preemptive asymmetric stacker crane problem
- Tree based models and algorithms for the preemptive asymmetric stacker crane problem
- scientific article; zbMATH DE number 5936273 (Why is no real title available?)
- The preemptive swapping problem on a tree
- Graphs, Maneuvers and Turnpikes
- Rapidly-exploring Sorted Random Tree: A Self Adaptive Random Motion Planning Algorithm
- Preemptive Ensemble Motion Planning on a Tree
- A new approach to optimal planning of robot motion on a tree with obstacles
- Theoretical Computer Science
- A traveller's problem
- Approximation algorithms for some min-max and minimum stacker crane cover problems
- Approximation algorithms for some min-max and minimum stacker crane cover problems
- Euler is standing in line dial-a-ride problems with precedence-constraints
- On-line single-server dial-a-ride problems
- A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
- Maximizing the number of rides served for time-limited Dial-a-Ride*
- Maximizing rides served for dial-a-ride on the uniform metric
- Heuristics for the mixed swapping problem
- An optimal algorithm for the stacker crane problem on fixed topologies
- Semi-preemptive routing on a linear and circular track
- A hard dial-a-ride problem that is easy on average
This page was built for publication: Nonpreemptive Ensemble Motion Planning on a Tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3141520)
