Bin packing problem

Known as: Bin packing, First fit algorithm, Bin-packing problem 
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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1974-2018
05010019742018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
We introduce the Generalized Bin Packing Problem, a new packing problem where, given a set of items characterized by volume and… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2009
2009
The Variable Sized Bin Packing Problem has a wide range of application areas including packing, scheduling, and manufacturing… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2005
2005
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In this paper, we consider the variable sized bin packing problem where the objective is to minimize the total cost of used bins… (More)
Is this relevant?
2003
2003
We study a variant of the classical bin-packing problem, the ordered open-end bin-packing problem, where first a bin can be… (More)
  • table 1
  • table 2
  • table 3
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A new framework for analyzing online bin packing algorithms is presented. This framework presents a unified way of explaining the… (More)
  • figure 1
  • figure 3
  • table I
  • table II
  • table IV
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into the minimum… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The bin packing problem, in which a set of items of various sizes has to be packed into a minimum number of identical bins, has… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
1982
Highly Cited
1982
We present several polynomial-time approximation algorithms for the one-dimensional bin-packing problem. using a subroutine to… (More)
Is this relevant?
Highly Cited
1980
Highly Cited
1980
In the bin-packing problem a list <italic>L</italic> of <italic>n</italic> numbers are to be packed into unit-capacity bins. For… (More)
  • figure 2
  • figure 4
  • figure 5
Is this relevant?