1. Preface

   • Graham Kendall
   • Karen Daniels
   • Edmund K. Burke

   Preface 22 June 2010 Pages: 1 - 3

2. Models and algorithms for fair layout optimization problems

   • Albert E. Fernandes Muritiba
   • Manuel Iori
   • Marcos J. Negreiros Gomes

   OriginalPaper 07 November 2008 Pages: 5 - 14

3. Bun splitting: a practical cutting stock problem

   • Celia A. Glass
   • Jeroen M. van Oostrum

   OriginalPaper Open access 13 November 2008 Pages: 15 - 33

4. New perspectives in VLSI design automation: deterministic packing by Sequence Pair

   • Adam Janiak
   • Andrzej Kozik
   • Maciej Lichtenstein

   OriginalPaper 13 November 2008 Pages: 35 - 56

5. Space and time allocation in a shipyard assembly hall

   • Maud Bay
   • Yves Crama
   • Philippe Rigo

   OriginalPaper 07 November 2008 Pages: 57 - 76

6. The Multi-Story Space Assignment Problem

   • Peter Hahn
   • J. MacGregor Smith
   • Yi-Rong Zhu

   OriginalPaper 20 November 2008 Pages: 77 - 103

7. A supernodal formulation of vertex colouring with applications in course timetabling

   • Edmund K. Burke
   • Jakub Mareček
   • Hana Rudová

   OriginalPaper 30 March 2010 Pages: 105 - 130

8. The location and allocation of products and product families on retail shelves

   • Robert A. Russell
   • Timothy L. Urban

   OriginalPaper 07 November 2008 Pages: 131 - 147

9. A piecewise linearization for retail shelf space allocation problem and a local search heuristic

   • Hasmukh K. Gajjar
   • Gajendra K. Adil

   OriginalPaper 13 November 2008 Pages: 149 - 167

10. On the cutting stock problem under stochastic demand

    • Douglas José Alem Jr.
    • Pedro Augusto  Munari Jr.
    • Paulo Augusto Valente Ferreira

    OriginalPaper 05 November 2008 Pages: 169 - 186

11. A new destructive bounding scheme for the bin packing problem

    • Bassem Jarboui
    • Saber Ibrahim
    • Abdelwaheb Rebai

    OriginalPaper 07 November 2008 Pages: 187 - 202

12. A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing

    • F. Parreño
    • R. Alvarez-Valdes
    • J. M. Tamarit

    OriginalPaper 25 October 2008 Pages: 203 - 220

13. A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint

    • Andrea Bettinelli
    • Alberto Ceselli
    • Giovanni Righini

    OriginalPaper 07 November 2008 Pages: 221 - 241

14. A novel non-linear approach to minimal area rectangular packing

    • Volker Maag
    • Martin Berger
    • Karl-Heinz Küfer

    OriginalPaper 05 November 2008 Pages: 243 - 260

15. Optimal rectangle packing

    • Richard E. Korf
    • Michael D. Moffitt
    • Martha E. Pollack

    OriginalPaper 07 November 2008 Pages: 261 - 295

16. A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem

    • Reinaldo Morabito
    • Vitória Pureza

    OriginalPaper 13 November 2008 Pages: 297 - 315

17. A survey of dual-feasible and superadditive functions

    • François Clautiaux
    • Cláudio Alves
    • José Valério de Carvalho

    OriginalPaper 07 November 2008 Pages: 317 - 342

18. Tools of mathematical modeling of arbitrary object packing problems

    • J. Bennell
    • G. Scheithauer
    • T. Romanova

    OriginalPaper 07 November 2008 Pages: 343 - 368

19. Generalized hyper-heuristics for solving 2D Regular and Irregular Packing Problems

    • H. Terashima-Marín
    • P. Ross
    • M. Valenzuela-Rendón

    OriginalPaper 15 November 2008 Pages: 369 - 392

20. Nature inspired genetic algorithms for hard packing problems

    • Philipp Rohlfshagen
    • John A. Bullinaria

    OriginalPaper 15 November 2008 Pages: 393 - 419