Solutions to Real-World Instances of PSPACE-Complete Stacking
From MaRDI portal
Publication:3527262
Recommendations
- Tree search for the stacking problem
- Complexity results for storage loading problems with stacking constraints
- An approximation algorithm for the stack-up problem
- scientific article; zbMATH DE number 2241892
- Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem
Cited in
(11)- Solving the unit-load pre-marshalling problem in block stacking storage systems with multiple access directions
- Using contracted solution graphs for solving reconfiguration problems
- Rerouting shortest paths in planar graphs
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- The pickup and delivery problem with time windows, multiple stacks, and handling operations
- A mathematical formulation and complexity considerations for the blocks relocation problem
- An efficient and fast local search based heuristic for reel management in a production line of oil extraction pipes
- An exact algorithm for the unrestricted block relocation problem
- Optimising the slab yard planning and crane scheduling problem using a two-stage heuristic
- An asymptotically optimal algorithm for online stacking
- An exact approach to the restricted block relocation problem based on a new integer programming formulation
This page was built for publication: Solutions to Real-World Instances of PSPACE-Complete Stacking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527262)
