Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,014,476 papers from all fields of science
Search
Sign In
Create Free Account
Bin packing problem
Known as:
Bin packing
, First fit algorithm
, Bin-packing problem
Expand
In the bin packing problem, objects of different volumes must be packed into a finite number of bins or containers each of volume V in a way that…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
25 relations
APX
Approximation algorithm
Backup
Computational complexity theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Bin Packing Problem: Two Approximation Algorithms
A. N. Zehmakan
arXiv.org
2015
Corpus ID: 14134317
The Bin Packing Problem is one of the most important optimization problems. In recent years, due to its NP-hard nature, several…
Expand
2010
2010
A new variable-sized bin packing problem
J. Boyar
,
Lene M. Favrholdt
Journal of Scheduling
2010
Corpus ID: 36147326
The problem of BLASTing a genome against a database of DNA sequences to identify potential relationships with other genomes can…
Expand
2004
2004
New approximability and inapproximability results for 2-dimensional Bin Packing
N. Bansal
,
M. Sviridenko
ACM-SIAM Symposium on Discrete Algorithms
2004
Corpus ID: 18014564
We study the 2-dimensional generalization of the classical Bin Packing problem: Given a collection of rectangles of specified…
Expand
Review
2002
Review
2002
Approximate solutions to bin packing problems
E. Coffman
,
J. Csirik
,
G. Woeginger
2002
Corpus ID: 60661915
63] G. Zhang. Worst-case analysis of the FFH algorithm for on-line variable-sized bin packing. First-Fit algorithms in two and…
Expand
2002
2002
Fair versus Unrestricted Bin Packing
Y. Azar
,
J. Boyar
,
Lene M. Favrholdt
,
Kim S. Larsen
,
M. N. Nielsen
,
L. Epstein
Algorithmica
2002
Corpus ID: 945379
AbstractAbstract. We consider the on-line Dual Bin Packing problem where we have nunit size bins and a sequence of items. The…
Expand
1999
1999
Local Search For The Bin Packing Problem
Adriana C. F. Alvim
,
F. Glover
,
C. Ribeiro
,
D. Aloise
1999
Corpus ID: 116030778
The bin packing problem consists in nding the minimum number of bins of given capacity which are necessary to pack a certain…
Expand
1998
1998
Worst-case analyses, linear programming and the bin-packing problem
L. A. Chan
,
D. Simchi-Levi
,
Julien Bramel
Mathematical programming
1998
Corpus ID: 37925404
In this paper we consider the familiar bin-packing problem and its associated set-partitioning formulation. We show that the…
Expand
1997
1997
Probabilistic Analysis of a Generalized Bin Packing Problem and Applications
A. Federgruen
,
G. V. Ryzin
Operational Research
1997
Corpus ID: 36907506
We give a unified probabilistic analysis for a general class of bin packing problems by directly analyzing corresponding…
Expand
1991
1991
Analysis of a Compound bin Packing Algorithm
D. K. Friesen
,
M. A. Langston
SIAM Journal on Discrete Mathematics
1991
Corpus ID: 28561146
Consider the classic bin packing problem, in which we seek to pack a list of items into the minimum number of unit-capacity bins…
Expand
Highly Cited
1988
Highly Cited
1988
Parallel Approximation Algorithms for Bin Packing
Richard J. Anderson
,
E. Mayr
,
Manfred K. Warmuth
Information and Computation
1988
Corpus ID: 14934001
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE