Pages that link to "Item:Q1699767"
From MaRDI portal
The following pages link to Approximation algorithms for the generalized stacker crane problem (Q1699767):
Displaying 12 items.
- Are stacker crane problems easy? A statistical study (Q340228) (← links)
- Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems (Q1283797) (← links)
- An approximation algorithm for the stack-up problem (Q1574533) (← links)
- Preemptive stacker crane problem: extending tree-based properties and construction heuristics (Q2030604) (← links)
- Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles (Q2307494) (← 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)
- A heuristic for the Stacker Crane Problem on trees which is almost surely exact (Q3410947) (← links)
- The stacker crane problem and the directed general routing problem (Q4642462) (← links)
- Algorithms and Computation (Q5191689) (← 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)