Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
From MaRDI portal
Publication:385496
DOI10.1007/s10878-011-9408-0zbMath1282.90149OpenAlexW1973566887MaRDI QIDQ385496
Zsolt Tuza, Deshi Ye, György Dósa
Publication date: 2 December 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9408-0
Related Items (9)
Colored bin packing: online algorithms and lower bounds ⋮ A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts ⋮ Online bin packing problem with buffer and bounded size revisited ⋮ Quasi-human seniority-order algorithm for unequal circles packing ⋮ More on ordered open end bin packing ⋮ Bin packing with directed stackability conflicts ⋮ Online results for black and white bin packing ⋮ Comparing the costs of any fit algorithms for bin packing ⋮ NF-based algorithms for online bin packing with buffer and bounded item size
Cites Work
- Unnamed Item
- Unnamed Item
- Tighter bounds of the First Fit algorithm for the bin-packing problem
- Approximation algorithms for time constrained scheduling
- An improved lower bound for on-line bin packing algorithms
- An approximation scheme for bin packing with conflicts
- On the online bin packing problem
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- On online bin packing with LIB constraints
- On-line and first fit colorings of graphs
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Effective coloration
- On the hardness of approximating minimization problems
- On Bin Packing with Conflicts
- Multi-dimensional Packing with Conflicts
- Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
- Partial orders of dimension 2
This page was built for publication: Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
