An Exact Approach to the Strip-Packing Problem
By Silvano Martello, Michele Monaci, Daniele Vigo. INFORMS journal on computing, 2003
310 citations recorded by the source corpus.
Subfields: Computer Graphics and Computer-Aided Design, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/6987965c3850216f4d37f9c76e0218434a024563
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
In Industrial and Manufacturing Engineering
- Silvano Martello
- Andrea Lodi
- Michele Monaci
- Gerhard Wäscher
- Holger Schumann
- Heike Haußner
- Manuel Iori
- Timo Berthold
Citations in the corpus
- Two-dimensional packing problems: A survey (2002, methodology): “[46] proposed specialized lower bounds for 2SP.”
- An improved typology of cutting and packing problems (2007, background): “In case the small items are rectangles (cf. Kröger, 1995; Jacobs, 1996; Hopper and Turton, 2001a; Martello et al., 2003) one may also refer to this problem as the Rectangular Strip Packing Problem, or even as the Orthogonal Rectangular Strip Packing Problem, if the small rectangles have to be laid o”