Limiting the number of each piece in two-dimensional cutting stock patterns
From MaRDI portal
Publication:1197090
DOI10.1016/0895-7177(92)90079-ZzbMath0757.90065MaRDI QIDQ1197090
Publication date: 16 January 1993
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Related Items
Cites Work
- Fixed charge problems with identical fixed charges
- Trim-loss pattern rearrangement and its relevance to the flat-glass industry
- A note on modifying a two-dimensional trim-loss algorithm to deal with cutting restrictions
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
- The knapsack problem with generalized upper bounds
- The trim-loss and assortment problems: A survey
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
- The cutting stock problem in the canvas industry
- A Linear Programming Approach to the Cutting-Stock Problem
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- An Algorithm for Two-Dimensional Cutting Problems
- Glass cutting in a small firm
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- Letter to the Editor—Toward a Unifying Theory for Integer Linear Programming
This page was built for publication: Limiting the number of each piece in two-dimensional cutting stock patterns
