Program for stream Cutting and Packing

HA-21: Cutting and Packing 1
Stream: Cutting and Packing
Room: Room 006
Chair(s): Antonio Martinez Sykora

• Two-Dimensional Bin Packing Problems with Irregularly-Shaped Pieces: Constructive Algorithms
  Ramon Alvarez-Valdes, Julia Bennell, Antonio Martinez Sykora, Jose Tamarit
• A Constructive Heuristic for the Three-Dimensional Bin Packing Problem with Transportation Constraints
  Célia Paquay, Michaël Schyns, Sabine Limbourg
• An Algorithm for a Container Loading Problem with Static Mechanical Equilibrium Conditions
  António Ramos, José Fernando Oliveira, José Fernando Gonçalves, Manuel Lopes
• A MIP-Based Dual Bounding Technique for the Irregular Nesting Problem
  

HB-21: Cutting and Packing 2
Stream: Cutting and Packing
Room: Room 006
Chair(s): A. Miguel Gomes

• Integer Programming Formulations for Approximate Solution of Circle Packing Problems
  Edith Lucero Ozuna Espinosa, Igor Litvinchev
• GPU-accelerated Irregular Nesting Algorithm with Raster Representation
  
• A Two-Phase Nonlinear Programming Approach for Nesting Problems with Continuous Rotations
  Pedro Rocha, A. Miguel Gomes, Rui Rodrigues, Franklina Toledo, Marina Andretta
• Upper Bounds for Heuristic Approaches to the Strip Packing Problem
  Torsten Buchwald, Guntram Scheithauer

HD-21: Cutting and Packing 3
Stream: Cutting and Packing
Room: Room 006
Chair(s): Ramon Alvarez-Valdes

• An Efficient MIP Formulation of the Container Loading Problem
  Giorgio Fasano
• Studying Different Models for the Truck Loading Process
  Maria Teresa Alonso Martínez, Ramon Alvarez-Valdes, Manuel Iori, Francisco Parreño, Jose Tamarit
• Efficient Local Search Algorithms for Three-Dimensional Packing Using Sequence-Triple
  

HE-21: Cutting and Packing 4
Stream: Cutting and Packing
Room: Room 006
Chair(s): José Fernando Gonçalves

• Exact Resolution of the Cover Printing Problem with a Branch and Bound Algorithm
  Arnaud Vandaele, Daniel Tuyttens
• A Dominance Criterion for Packing Problems
  
• An Integrated Facility Layout and Product Range Planning Problem
  Bernd Hillebrand, Grigory Pishchulov
• A Biased Random Key Genetic Algorithm for the Facility Layout Problem
  José Fernando Gonçalves

FA-21: Cutting and Packing 5
Stream: Cutting and Packing
Room: Room 006
Chair(s):

• Cutting Stock Problem with Rectangular and Irregular Pieces
  
• A Partition-based Heuristic Algorithm for the Large-scale Rectilinear Block Packing Problem
  Sullivan Hué, Hideki Hashimoto, Shinji Imahori, Mutsunori Yagiura
• Approaches to Enhance the Efficiency of Cutting Stock for Furniture Production
  Socorro Rangel
• Integrated Cutting and Production Planning in a Home Textile Manufacturing Company
  Elsa Silva, José Fernando Oliveira, Maria Antónia Carravilla

FB-21: Cutting and Packing 6
Stream: Cutting and Packing
Room: Room 006
Chair(s): Guntram Scheithauer

• Minimal Proper Non-IRUP Instances of the One-Dimensional Cutting Stock Problem
  
• New Inequalities for 1D Relaxations of the 2D Strip Packing Problem
  Isabel Friedow, Guntram Scheithauer
• Branch-and-Price Methods for the 1D Contiguous Bin Packing Problem
  Marat Mesyagutov, Guntram Scheithauer, Gleb Belov
• A Two-Objective Two-Dimensional Cutting Stock and Assortment Problem
  Banu İçmen, Refail Kasimbeyli