Cutting stock problem

Known as: Nesting problem, Nesting problem (geometric optimization) 
In operations research, the cutting-stock problem is the problem of cutting standard-sized pieces of stock material, such as paper rolls or sheet… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
This paper deals with the one-dimensional integer cutting stock problem, which consists of cutting a set of available objects in… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org… (More)
Is this relevant?
2007
2007
Working with an integer bilinear programming formulation of a one-dimen-sional cutting-stock problem, we develop an ILP-based… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2004
2004
The one-dimensional cutting stock problem (CSP) is a classic combinatorial optimization problem in which a number of parts of… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper discusses some of the basic formulation issues and solution procedures for solving oneand twodimensional cutting stock… (More)
  • figure 1
  • figure 2
Is this relevant?
2003
2003
  • 2003
I N T R O D U C T I O N In a number of industries, such as paper and film, there is an important class of problems OVER THE past… (More)
  • figure 1
  • table 1
Is this relevant?
2001
2001
One of the factors that add to the complexity of the cutting stock problem is the large number of the cutting patterns that may… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of xed… (More)
  • figure 4
Is this relevant?
1999
1999
In the cutting stock problem (CSP) a given order for smaller pieces has to be cut from larger stock material in such a way that… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
1985
1985
An integer programming problem is said to have the integer round-up property if its optimal value is given by the least integer… (More)
Is this relevant?