Pages that link to "Item:Q3141520"

The following pages link to Nonpreemptive Ensemble Motion Planning on a Tree (Q3141520):

Displaying 15 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)
• 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)
• 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)
• 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)