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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

Any list of rectangular items of total area not greater than 0.2837 can be packed online into the unit square (\(90^{\circ…

2015

The Bin Packing Problem is one of the most important optimization problems. In recent years, due to its NP-hard nature, several…

2012

Bin packing problem is a traditional problem in combinatorial optimization and applied widely in modern society. This paper…

2010

We present a hybrid chaotic ant swarm approach for the graph coloring problem (CASCOL). This approach is based on a novel swarm…

2003

The bin packing problem (BPP) is a well-known NP-hard combinatorial optimization problem which occurs in many contexts, including…

2002

Combined with best fit approximation algorithm and genetic algorithm, a new hybrid genetic algorithm is proposed in this paper…

2001

The bin packing problem asks for a packing of a list of items from [0, 1] into the smallest possible number of bins having unit…

2001

The bin packing problem asks for a packing of a list of items from (0, 1] into the smallest possible number of bins having unit…

1999

The bin packing problem consists in nding the minimum number of bins of given capacity which are necessary to pack a certain…

1995

This paper introduces a new framework for modeling and solving dynamic fleet management problems, which we call the Logistics…