Pages that link to "Item:Q5918581"
From MaRDI portal
The following pages link to Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918581):
Displaying 8 items.
- Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems (Q1283797) (← links)
- Approximation algorithms for the generalized stacker crane problem (Q1699767) (← links)
- Preemptive stacker crane problem: extending tree-based properties and construction heuristics (Q2030604) (← links)
- Approximation algorithms for some min-max postmen cover problems (Q2241210) (← 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 (Q5918727) (← links)
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6130323) (← links)