Two-dimensional bin packing problems
From MaRDI portal
Recommendations
- Recent advances on two-dimensional bin packing problems
- Two-dimensional packing problems: a survey
- Two-Dimensional Finite Bin-Packing Algorithms
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Exact solution of the two-dimensional finite bin packing problem
Cited in
(18)- Minimum tiling of a rectangle by squares
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
- Two-dimensional packing problems: a survey
- Exact solution techniques for two-dimensional cutting and packing
- Number of bins and maximum lateness minimization in two-dimensional bin packing
- A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
- 2DPackLib: a two-dimensional cutting and packing library
- A branch-and-price algorithm for the temporal bin packing problem
- Online circle and sphere packing
- Two dimensional guillotine cutting stock and scheduling problem in printing industry
- On a dual version of the one-dimensional bin packing problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Models and algorithms for packing rectangles into the smallest square
- Bidimensional Packing by Bilinear Programming
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Mathematical models and heuristic algorithms for pallet building problems with practical constraints
- Recent advances on two-dimensional bin packing problems
- On vehicle routing problems with loading constraints
This page was built for publication: Two-dimensional bin packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059312)
