Premium
The skiving stock problem as a counterpart of the cutting stock problem
Author(s) -
Zak E. J.
Publication year - 2003
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/1475-3995.00433
Subject(s) - cutting stock problem , computer science , stock (firearms) , mathematical optimization , optimization problem , combinatorial optimization , set packing , packing problems , mathematics , set (abstract data type) , programming language , mechanical engineering , engineering
The cutting stock problem (CSP) is a particular case of the set‐covering problem. Similarly we introduce another class of combinatorial optimization problems called the skiving stock problem (SSP) as a particular case of the set‐packing problem. The SSP shares many properties and solving techniques with the CSP. When these two problem spaces are contrasted they illuminate one another in that they form a ‘dual’ relationship where techniques once thought to be applicable in one domain can be applied in the other. Furthermore the SSP, like the CSP, may have numerous applications in business and industry.