Relations between capacity utilization, minimal bin size and bin number
From MaRDI portal
(Redirected from Publication:490141)
Recommendations
- Maximizing the number of unused bins
- Number of bins and maximum lateness minimization in two-dimensional bin packing
- Min-sum bin packing
- Optimal Bin Packing with Items of Random Sizes
- Bin packing under linear constraints
- scientific article; zbMATH DE number 6842581
- Bin packing with fixed number of bins revisited
- Bin packing with fixed number of bins revisited
- A tight lower bound for optimal bin packing
- Bin packing with restricted piece sizes
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- Approximation algorithms for multiple strip packing
- Exact solution of the two-dimensional finite bin packing problem
- Maximizing the total profit of rectangles packed into a rectangle
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- On Three-Dimensional Packing
- On packing of squares and cubes
- One-dimensional relaxations and LP bounds for orthogonal packing
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Relations between capacity utilization, minimal bin size and bin number
- Two-dimensional packing problems: a survey
Cited in
(2)
This page was built for publication: Relations between capacity utilization, minimal bin size and bin number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490141)
