Parameterized complexity of strip packing and minimum volume packing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 6861944 (Why is no real title available?)
- scientific article; zbMATH DE number 3423800 (Why is no real title available?)
- A near-optimal solution to a two-dimensional cutting stock problem
- A note on online strip packing
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Approximating minimum-area rectangular and convex containers for packing convex polygons
- Bin packing with fixed number of bins revisited
- Improved lower bound for online strip packing
- Online strip packing with modifiable boxes
- Optimal rectangle packing: an absolute placement approach
- Parameterized algorithms
- Parametrized complexity theory.
- Polynomiality for bin packing with a constant number of item types
- Two-dimensional packing problems: a survey
Cited in
(3)
This page was built for publication: Parameterized complexity of strip packing and minimum volume packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501656)