The bin packing problem is an optimization problem, in which items of different sizes must be packed into a finite number of bins or containers, each...

region of the container, where objects are allowed to overlap. In a bin packing problem, people are given: A container, usually a two- or three-dimensional...

needed after suffix trees and the bin packing problem. The most common problem being solved is the 0-1 knapsack problem, which restricts the number x i...

algorithm for bin packing. Its input is a list of items of different sizes. Its output is a packing - a partition of the items into bins of fixed capacity...

Bin picking (also referred to as random bin picking) is a core problem in computer vision and robotics. The goal is to have a robot with sensors and cameras...

algorithm for bin packing. Its input is a list of items of different sizes. Its output is a packing - a partition of the items into bins of fixed capacity...

way that maximizes the number of bins used. This problem is a dual of the bin packing problem: in bin covering, the bin sizes are bounded from below and...

The strip packing problem is a 2-dimensional geometric minimization problem. Given a set of axis-aligned rectangles and a strip of bounded width and infinite...

optimization problems. It was introduced in the context of the cutting stock problem. Later, it has been applied to the bin packing and job scheduling problems. In...

Set packing is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems. Suppose...