Solving the pattern minimization problem with branch-and-price and constraint programming
Cláudio Alves, Rita Macedo, José Valério de Carvalho
Proceedings of the 3rd International Workshop on Bin Packing and Placement Constraints associated to the 7th International Conference on Integration of AI and OR Techniques in Constraint Programming - CPAIOR 2010
Bologna, Italy, June 2010

ABSTRACT
The pattern minimization problem is a cutting stock problem whose objective is to minimize the number of different patterns in a cutting plan. In this paper, we explore the exact resolution of this problem using branch-and-price and constraint programming. Our approach is based on a column generation model proposed recently. Different strategies to strengthen it are described, and branching rules are explored. Computational experiments on real-world instances are reported.

BIBTEX ENTRY
@inproceedings{AlvesMacedoCarvalhoCPAIOR10,
author = {Cl{\'a}udio Alves and Rita Macedo and Jos{\'e} Val{\'e}rio de Carvalho},
title = {Solving the pattern minimization problem with branch-and-price and constraint programming},
booktitle = {Proceedings of the 3rd International Workshop on Bin Packing and Placement Constraints associated to the 7th International Conference on Integration of AI and OR Techniques in Constraint Programming - CPAIOR 2010},
address = {Bologna, Italy},
year = {2010}}