Pages that link to "Item:Q3813294"

The following pages link to Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel (Q3813294):

Displaying 37 items.

• Models for the single-vehicle preemptive pickup and delivery problem (Q421257) (← links)
• 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)
• How to collect balls moving in the Euclidean plane (Q860383) (← links)
• A hard dial-a-ride problem that is easy on average (Q880497) (← links)
• Semi-preemptive routing on trees (Q1003476) (← links)
• Dynamic sequencing of robot moves in a manufactoring cell (Q1309972) (← links)
• Routing a vehicle of capacity greater than one (Q1382252) (← links)
• Scheduling electric vehicles and locating charging stations on a path (Q1617297) (← links)
• The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail (Q1691943) (← links)
• Crane scheduling in railway yards: an analysis of computational complexity (Q1707828) (← 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)
• Optimal bin location and sequencing in printed circuit board assembly (Q2367380) (← 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)
• Pickup and delivery problems with autonomous vehicles on rings (Q2670581) (← links)
• Pallet location and job scheduling in a twin-robot system (Q2676351) (← links)
• Approximation algorithms for multi-vehicle stacker crane problems (Q2687683) (← links)
• Improved bounds for open online dial-a-ride on the line (Q2701389) (← 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)
• The preemptive swapping problem on a tree (Q3100688) (← links)
• Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks (Q3150129) (← links)
• Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line (Q3300763) (← links)
• Semi–preemptive routing on a line (Q3439160) (← links)
• Serving requests with on-line routing (Q5056164) (← links)
• Competitive algorithms for the on-line traveling salesman (Q5057434) (← links)
• (Q5090461) (← links)
• A branch‐and‐cut algorithm for the nonpreemptive swapping problem (Q5187945) (← links)
• (Q5875473) (← 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)
• How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring (Q6102844) (← links)