Jul 1, 2012 · This paper describes a technique for the three-dimensional strip packing problem that utilizes a reference length heuristic. Using the extreme ...

We propose a block building heuristic based on extreme points for this problem that uses a reference length to guide its solution. Our 3DSP approach employs ...

We propose a block building heuristic based on extreme points for this problem that uses a reference length to guide its solution. Our 3DSP approach employs ...

A reference length approach for the 3D strip packing problem ; Year of publication: 2012 ; Authors: Wei, Lijun ; Oon, Wee-chong ; Zhu, Wenbin ; Lim, Andrew.

TL;DR: This work proposes a block building heuristic based on extreme points for this problem that uses a reference length to guide its solution and employs ...

Lijun Wei , Wee-Chong Oon, Wenbin Zhu, Andrew Lim : A reference length approach for the 3D strip packing problem. Eur. J. Oper. Res. 220(1): 37-47 (2012).

This paper studies the three dimensional strip packing problem (3DSPP) with practical constraints. The objective is to pack a set of three-dimensional items ...

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 ...

We propose a block building heu-ristic based on extreme points for this problem that uses a reference length to guide its solution. Our 3DSP approach ...

A reference length approach for the 3D strip packing problem · Computer Science, Mathematics. Eur. J. Oper. Res. · 2012.