This paper regards the problem of the two-dimensional irregular cutting stock problem (ICSP), where the pieces to be cut out may be of any shape. The sequential value correction method has been developed to solve this problem. This method is based on dual values (variables), which is the essential concept of linear programming. We suggest a technique of value calculation for such pieces. The algorithms are included. We also describe a computing experiment whose results are the evidence of the good performance of the algorithms developed.
irregular cutting stock problem; nesting; heuristics; hodograph
