Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
From MaRDI portal
Publication:385496
DOI10.1007/S10878-011-9408-0zbMATH Open1282.90149OpenAlexW1973566887MaRDI QIDQ385496FDOQ385496
Authors: 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
Recommendations
- A tight lower bound for optimal bin packing
- scientific article; zbMATH DE number 3997164
- Ranking lower bounds for the bin-packing problem
- An improved lower bound for the bin packing problem
- scientific article; zbMATH DE number 1187157
- Lower bounds and reduction procedures for the bin packing problem
- Lower bounds for batched bin packing
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- New lower bounds for certain classes of bin packing algorithms
- New Lower Bounds for Certain Classes of Bin Packing Algorithms
Cites Work
- Title not available (Why is that?)
- On the online bin packing problem
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Partial orders of dimension 2
- An improved lower bound for on-line bin packing algorithms
- Effective coloration
- On the hardness of approximating minimization problems
- On-line and first fit colorings of graphs
- Title not available (Why is that?)
- Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- An approximation scheme for bin packing with conflicts
- Approximation algorithms for time constrained scheduling
- On online bin packing with LIB constraints
- On Bin Packing with Conflicts
- Multi-dimensional Packing with Conflicts
- Tighter bounds of the First Fit algorithm for the bin-packing problem
Cited In (15)
- Online results for black and white bin packing
- Comparing the costs of any fit algorithms for bin packing
- Colored bin packing: online algorithms and lower bounds
- NF-based algorithms for online bin packing with buffer and bounded item size
- Title not available (Why is that?)
- A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm
- More on ordered open end bin packing
- Performance estimations of first fit algorithm for online bin packing with variable bin sizes and LIB constraints
- On online bin packing with LIB constraints
- About the Structure of the Integer Cone and Its Application to Bin Packing
- Bin packing with directed stackability conflicts
- Online bin packing problem with buffer and bounded size revisited
- Title not available (Why is that?)
- A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts
- Quasi-human seniority-order algorithm for unequal circles packing
This page was built for publication: Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385496)
