Directed Pathwidth and Palletizers
From MaRDI portal
Publication:3467832
DOI10.1007/978-3-319-26626-8_3zbMath1478.90107OpenAlexW2294606586MaRDI QIDQ3467832
Frank Gurski, Jochen Rethmann, Egon Wanke
Publication date: 5 February 2016
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_3
computational complexitycombinatorial optimizationdirected pathwidthpalletizing systemsstack-up systems
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On the complexity of the FIFO stack-up problem
- Approximation algorithms for digraph width parameters
- Online algorithms. The state of the art
- Min Cut is NP-complete for edge weighted trees
- Storage controlled pile-up systems, theoretical foundations
- Performance approximation of pick-to-belt orderpicking systems
- An approximation algorithm for the stack-up problem
- Stack-up algorithms for palletizing at delivery industry
- Directed tree-width
- Algorithms for Controlling Palletizers
- A Polynomial Time Algorithm for Bounded Directed Pathwidth
- Quantitative Graph Theory
- Computing Directed Pathwidth in O(1.89 n ) Time