Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations
type: Item
instance of: scholarly article
title: Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations
zbMATH Open document ID: 1282.90149
author: Zsolt Tuza
author: Deshi Ye
author: György Dósa
published in: Journal of Combinatorial Optimization
publication date: 2013-12-02T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6235167
zbMATH Keywords: bin packing
zbMATH Keywords: LIB constraint
zbMATH Keywords: incompatibility graph
MaRDI profile type: Publication
full work available at URL: s10878-011-9408-0
OpenAlex ID: W1973566887
cites work: Partial orders of dimension 2
cites work: Effective coloration
cites work: Q4223058
cites work: The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
cites work: On online bin packing with LIB constraints
cites work: On Bin Packing with Conflicts
cites work: Multi-dimensional Packing with Conflicts
cites work: Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
cites work: On-line and first fit colorings of graphs
cites work: An approximation scheme for bin packing with conflicts
cites work: Approximation algorithms for time constrained scheduling
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: On the hardness of approximating minimization problems
cites work: Q4820876
cites work: On the online bin packing problem
cites work: An improved lower bound for on-line bin packing algorithms
cites work: Tighter bounds of the First Fit algorithm for the bin-packing problem
DOI: 10.1007/S10878-011-9408-0
Recommended article: A tight lower bound for optimal bin packing
Recommended article: Q4723300
Recommended article: Ranking lower bounds for the bin-packing problem
Recommended article: An improved lower bound for the bin packing problem
Recommended article: Q3840364
Recommended article: Lower bounds and reduction procedures for the bin packing problem
Recommended article: Lower bounds for batched bin packing
Recommended article: Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Recommended article: New lower bounds for certain classes of bin packing algorithms
Recommended article: New Lower Bounds for Certain Classes of Bin Packing Algorithms
description: scientific article; zbMATH DE number 6235167