What is it about?
This is a technical note on lower bounds to the number of distinct patterns one must adopt to cut small items of given size from large stock items with a given trim loss allowance
Featured Image
Why is it important?
We improve lower bounds obtained in previous research by other Authors
Perspectives
Not only lower bounds provide an estimate of a heuristic solution quality, but good ones are critical for the proof of optimality via branch-and-price
Claudio Arbib
Read the Original
This page is a summary of: On LP relaxations for the pattern minimization problem, Networks, December 2010, Wiley,
DOI: 10.1002/net.20422.
You can read the full text:
Contributors
The following have contributed to this page
