On LP Relaxations for the Pattern Minimization Problem
We discuss two formulations of the Pattern Minimization Problem: (1) introduced by Vanderbeck, and (2) obtained adding setup variables to the cutting stock formulation by Gilmore-Gomory. Let $z_i^{LP}(u)$ be the bound given by the linear relaxation of ($i$) under a given vector $u = (u_k)$ of parameters. We show that $z_2^{LP}(u}) \ge z_1^{LP}(u)$ and provide … Read more