Pages that link to "Item:Q4642462"

The following pages link to The stacker crane problem and the directed general routing problem (Q4642462):

Displaying 15 items.

• Are stacker crane problems easy? A statistical study (Q340228) (← links)
• A branch-and-cut algorithm for the orienteering arc routing problem (Q342166) (← links)
• Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems (Q1283797) (← links)
• Approximation algorithms for the generalized stacker crane problem (Q1699767) (← links)
• The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm (Q1752763) (← links)
• The directed profitable rural postman problem with incompatibility constraints (Q1753601) (← links)
• Preemptive stacker crane problem: extending tree-based properties and construction heuristics (Q2030604) (← links)
• The min-max close-enough arc routing problem (Q2116901) (← links)
• The profitable close-enough arc routing problem (Q2669779) (← links)
• Tree based models and algorithms for the preemptive asymmetric stacker crane problem (Q2907956) (← links)
• Algorithms and Computation (Q5191689) (← links)
• Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918727) (← links)
• Modeling and solving the endpoint cutting problem (Q6056164) (← links)
• Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
• An updated annotated bibliography on arc routing problems (Q6496350) (← links)