On LP relaxations for the pattern minimization problem

DOI10.1002/net.20422zbMath1225.90083OpenAlexW2064501715MaRDI QIDQ3008919

Claudio Arbib, Alessandro Aloisio, Fabrizio Marinelli

Publication date: 22 June 2011

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20422

zbMATH Keywords

cutting stocklinear relaxationsinteger decomposition

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (3)

Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem ⋮ Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost ⋮ Cutting stock with no three parts per pattern: work-in-process and pattern minimization

Uses Software

• CUTGEN1

Cites Work

• Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
• New lower bounds based on column generation and constraint programming for the pattern minimization problem
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
• LP models for bin packing and cutting stock problems
• One-dimensional cutting stock problem to minimize the number of different patterns
• A generic view of Dantzig--Wolfe decomposition in mixed integer programming
• Fast lifting procedures for the bin packing problem
• Mathematical Methods of Organizing and Planning Production
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II

This page was built for publication: On LP relaxations for the pattern minimization problem