An approximation algorithm for the stack-up problem
From MaRDI portal
Recommendations
- Approximation algorithms for the generalized stacker crane problem
- Approximability of the multiple stack TSP
- An approximation algorithm for stacking up bins from a conveyer onto pallets
- Heuristic search for the stacking problem
- On the complexity of the FIFO stack-up problem
- Approximate dynamic programming for container stacking
- A practical approach for the FIFO stack-up problem
- An asymptotically optimal algorithm for online stacking
- scientific article; zbMATH DE number 1782346
Cited in
(14)- Competitive analysis of on-line stack-up algorithms
- Solutions to Real-World Instances of PSPACE-Complete Stacking
- scientific article; zbMATH DE number 1782346 (Why is no real title available?)
- On the complexity of the FIFO stack-up problem
- Stack-up algorithms for palletizing at delivery industry
- A practical approach for the FIFO stack-up problem
- The stack loading and unloading problem
- An approximation algorithm for stacking up bins from a conveyer onto pallets
- Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms
- scientific article; zbMATH DE number 1780162 (Why is no real title available?)
- On a pattern sequencing problem to minimize the maximum number of open stacks
- Approximate dynamic programming for container stacking
- Approximation algorithms for the generalized stacker crane problem
- Directed pathwidth and palletizers
This page was built for publication: An approximation algorithm for the stack-up problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1574533)
