Pages that link to "Item:Q3141520"
From MaRDI portal
The following pages link to Nonpreemptive Ensemble Motion Planning on a Tree (Q3141520):
Displaying 26 items.
- A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (Q602676) (← links)
- Heuristics for the mixed swapping problem (Q733528) (← links)
- Semi-preemptive routing on a linear and circular track (Q834179) (← links)
- A hard dial-a-ride problem that is easy on average (Q880497) (← links)
- Semi-preemptive routing on trees (Q1003476) (← links)
- Routing a vehicle of capacity greater than one (Q1382252) (← links)
- New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization (Q1602710) (← links)
- The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail (Q1691943) (← links)
- Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system (Q1751731) (← links)
- Preemptive stacker crane problem: extending tree-based properties and construction heuristics (Q2030604) (← links)
- How to sort by walking and swapping on paths and trees (Q2408166) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- Approximation algorithms for multi-vehicle stacker crane problems (Q2687683) (← links)
- Generalisations of the Gilmore-Gomory traveling salesman problem and the Gilmore-Gomory scheme: a survey (Q2772854) (← links)
- Tree based heuristics for the preemptive asymmetric stacker crane problem (Q2883548) (← links)
- Tree based models and algorithms for the preemptive asymmetric stacker crane problem (Q2907956) (← links)
- (Q3020677) (← links)
- The preemptive swapping problem on a tree (Q3100688) (← links)
- Graphs, Maneuvers and Turnpikes (Q3486347) (← links)
- Rapidly-exploring Sorted Random Tree: A Self Adaptive Random Motion Planning Algorithm (Q3564528) (← links)
- A new approach to optimal planning of robot motion on a tree with obstacles (Q4595513) (← links)
- Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918581) (← links)
- Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918727) (← links)
- Euler is standing in line dial-a-ride problems with precedence-constraints (Q5948963) (← links)
- On-line single-server dial-a-ride problems (Q5958715) (← links)
- Maximizing the number of rides served for time-limited Dial-a-Ride* (Q6661115) (← links)