The Three-Dimensional Bin Packing Problem

706 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Routing problems with loading constraints (2010, methodology): “Exact algorithms for the 3BPP have been given by Martello, Pisinger and Vigo [68] (see also [38]) and by Martello, Pisinger, Vigo, den Boef and Korst [69].”
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints (2007, methodology): “…(1997) showed that the set of feasible placement positions for the 2BPP can be limited to the finite set of the contour points of the contour associated with the already placed items (similar results were described by Martello et al. (2000) for the 3BPP where such points were called corner points).”
An Exact Approach to the Strip-Packing Problem (2003, methodology): “In order to determine the optimal solution to 2SP we embedded the lower bounds of the previous section into an adaptation of the branch-and-bound algorithms proposed by Scheithauer (1997) and Martello et al. (2000) for ﬁlling a single two-dimensional bin.”
Two-dimensional packing problems: A survey (2002, neutral): “[47] for 2BP.”
Heuristics for the container loading problem (2002, neutral): “Keywords: Cutting/packing; Container loading; Knapsack packing; Heuristics”
A Tabu Search Algorithm for a Routing and Container Loading Problem (2006, background): “The problem of deciding whether a set of threedimensional boxes can be packed into a rectangular container with no additional constraint is already NP-hard (see, e.g., Martello, Pisinger, and Vigo 2000 ).”