Heuristics for the container loading problem

By David Pisinger. European Journal of Operational Research, 2002

380 citations recorded by the source corpus.

Subfields: Computer Graphics and Computer-Aided Design, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/9910d3d0b79c963f8cffff8d98cbe288f7830646

How researchers see this paper

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

In Computer Graphics and Computer-Aided Design

1. Manuel Iori
2. Gerhard Wäscher
3. Silvano Martello

In Industrial and Manufacturing Engineering

1. Manuel Iori
2. Silvano Martello
3. Michel Gendreau
4. Gilbert Laporte
5. Gerhard Wäscher
6. Holger Schumann
7. Heike Haußner
8. Thibaut Vidal

Citations in the corpus

• An improved typology of cutting and packing problems (2007, background): “Knapsack Problem into two and more geometric dimensions give rise to the Two-Dimensional (Single Orthogonal) Knapsack Problem (Caprara and Monaci, 2004; also see e.g., Healy and Moll, 1996), in which a set of small, distinct rectangles has to be cut from a single large rectangle (two-dimensional, re”
• A Tabu Search Algorithm for a Routing and Container Loading Problem (2006, background): “The loading problem is related to various threedimensional packing problems, in particular to container-loading problems, where constraints on the supporting surface or on the fragility of the items are frequently considered (e.g., Bortfeldt and Gehring 2001; Eley 2002; Pisinger 2002).”