Relations between capacity utilization, minimal bin size and bin number
From MaRDI portal
Publication:490141
DOI10.1007/S10479-014-1572-ZzbMATH Open1304.90169OpenAlexW1488941834MaRDI QIDQ490141FDOQ490141
Authors: Torsten Buchwald, Kirsten Hoffmann, Guntram Scheithauer 
Publication date: 22 January 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1572-z
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
- Title not available (Why is that?)
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Maximizing the total profit of rectangles packed into a rectangle
- Two-dimensional packing problems: a survey
- Exact solution of the two-dimensional finite bin packing problem
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- On Three-Dimensional Packing
- Approximation algorithms for multiple strip packing
- On packing of squares and cubes
- One-dimensional relaxations and LP bounds for orthogonal packing
- Relations between capacity utilization, minimal bin size and bin number
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)
