| 239 | -- | 240 | P. Y. Wang, Gerhard Wäscher. Cutting and packing |
| 241 | -- | 252 | Andrea Lodi, Silvano Martello, Michele Monaci. Two-dimensional packing problems: A survey |
| 253 | -- | 273 | José M. Valério de Carvalho. LP models for bin packing and cutting stock problems |
| 274 | -- | 294 | G. Belov, Guntram Scheithauer. A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths |
| 295 | -- | 312 | Oliver Holthaus. Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths |
| 313 | -- | 327 | Eugene J. Zak. Modeling multistage cutting stock problems |
| 328 | -- | 340 | Michael Armbruster. A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry |
| 341 | -- | 358 | Yu-Liang Wu, Wenqi Huang, Siu-Chung Lau, C. K. Wong, Gilbert H. Young. An effective quasi-human based heuristic for solving the rectangle packing problem |
| 359 | -- | 370 | A. Miguel Gomes, José F. Oliveira. A 2-exchange heuristic for nesting problems |
| 371 | -- | 381 | Kathryn A. Dowsland, Subodh Vaid, William B. Dowsland. An algorithm for polygon placement using a bottom-left strategy |
| 382 | -- | 392 | David Pisinger. Heuristics for the container loading problem |
| 393 | -- | 409 | Michael Eley. Solving container loading problems by block arrangement |
| 410 | -- | 420 | Andrea Lodi, Silvano Martello, Daniele Vigo. Heuristic algorithms for the three-dimensional bin packing problem |
| 421 | -- | 439 | Lauro Lins, Sóstenes Lins, Reinaldo Morabito. An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container |
| 440 | -- | 453 | Huaiqing Wang, Wenqi Huang, Quan Zhang, Dongming Xu. An improved algorithm for the packing of unequal circles within a larger containing circle |
| 454 | -- | 469 | Risto Lahdelma, Pekka Salminen. Pseudo-criteria versus linear utility function in stochastic multi-criteria acceptability analysis |