Algorithms for the two dimensional bin packing problem with partial conflicts
From MaRDI portal
Recommendations
- Algorithms for the bin packing problem with conflicts
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Heuristics and lower bounds for the bin packing problem with conflicts
- Heuristics for solving the bin-packing problem with conflicts
- Two-dimensional packing problems: a survey
Cites work
- Algorithms for the bin packing problem with conflicts
- An approximation scheme for bin packing with conflicts
- Fast algorithms for bin packing
- Heuristics and lower bounds for the bin packing problem with conflicts
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- New lower bounds for bin packing problems with conflicts
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Two-Dimensional Finite Bin-Packing Algorithms
Cited in
(4)- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- An exact algorithm for the dual bin packing problem
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Algorithms for the bin packing problem with conflicts
This page was built for publication: Algorithms for the two dimensional bin packing problem with partial conflicts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2893341)
