Results 1  10
of
279,590
Cutting stock by iterated matching
 in Operations Research Proceedings, Selected Papers of the Int. Conf. on OR 94
, 1995
"... The combinatorial optimization problem considered in this paper is a special two dimensional cutting stock problem arising in the wood, metal and glass industry. Given a demand of non oriented small rectangles and a theoretically in nite set of large stock rectangles of given lengths and widths, the ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
The combinatorial optimization problem considered in this paper is a special two dimensional cutting stock problem arising in the wood, metal and glass industry. Given a demand of non oriented small rectangles and a theoretically in nite set of large stock rectangles of given lengths and widths
Optimal Solution of One Dimension Cutting Stock Problem
, 1994
"... Optimal solution of one dimension cutting stock problem ..."
On the MAXGAP Problem for Cutting Stock Problems
, 1994
"... The MAXGAP problem of a linear integer optimization problem P consists in determining the maximum difference (gap) \Delta(P ) between the optimal value z (E) of an instance E 2 P and the LP bound z c (E) with respect to all E 2 P . In the case of the onedimensional cutting stock problem (1D CSP ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
The MAXGAP problem of a linear integer optimization problem P consists in determining the maximum difference (gap) \Delta(P ) between the optimal value z (E) of an instance E 2 P and the LP bound z c (E) with respect to all E 2 P . In the case of the onedimensional cutting stock problem (1D
Mass customization in cutting stock process
"... Abstract: In order to achieve mass customization all processes must be structured and executed in a suitable way. The paper shows an approach to cutting stock problem that, in contrary to most available methods, enables continuous cutting and optimization of cutting process over consecutive time per ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract: In order to achieve mass customization all processes must be structured and executed in a suitable way. The paper shows an approach to cutting stock problem that, in contrary to most available methods, enables continuous cutting and optimization of cutting process over consecutive time
CuttingStock Revisited
"... In this paper we reconsider a problem solved 10 years ago with CHIP. Using the new search tree tool in CHIP, we analyze the previous results and better explain the behavior of the different programs. The then show how to combine the different finite domain models and how to link in the linear solver ..."
Abstract
 Add to MetaCart
In this paper we reconsider a problem solved 10 years ago with CHIP. Using the new search tree tool in CHIP, we analyze the previous results and better explain the behavior of the different programs. The then show how to combine the different finite domain models and how to link in the linear solver in order to improve the constraint reasoning. While this problem is not very hard by current standards, it illustrates the need to define the constraint model properly in order to find solutions quickly. The search tree tool in CHIP is used to understand the search behavior, examples of the search trees generated are shown. 2
Tighter relaxations for the cutting stock problem
 European Journal of Operational Research
, 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 the number of stock material needed is minimal. Based on the classical integer linear programming model the common solution technique consists of solving the corresponding ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
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 the number of stock material needed is minimal. Based on the classical integer linear programming model the common solution technique consists of solving the corresponding
Integer Solutions to Cutting Stock Problems
"... We consider two integer linear programming models for the onedimensional cutting stock problem that include various difficulties appearing in practical real problems. Our primary goals are the minimization of the trim loss or the minimization of the number of master rolls needed to satisfy the orde ..."
Abstract
 Add to MetaCart
We consider two integer linear programming models for the onedimensional cutting stock problem that include various difficulties appearing in practical real problems. Our primary goals are the minimization of the trim loss or the minimization of the number of master rolls needed to satisfy
FacetDefining Inequalities for the Cutting Stock Problem
, 1997
"... In this paper the polyhedron of the cutting stock problem is investigated with respect to facetdefining inequalities. For some classes of valid inequalities this property is proved. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper the polyhedron of the cutting stock problem is investigated with respect to facetdefining inequalities. For some classes of valid inequalities this property is proved.
Genetic Algorithms for Cutting Stock Problems: with and without Contiguity
, 1994
"... A number of optimisation problems involve the optimal grouping of a finite set of items into a number of categories subject to one or more constraints. Such problems raise interesting issues in mapping solutions in genetic algorithms. These problems range from the knapsack problem to bin packing and ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
and cutting stock problems. This paper describes research involving cutting stock problems. Results show that the mapping that is used affects the solution in terms of both quality of the solution found and time taken to find solutions, and that different mappings are suitable for different variants
Solving the TwoStage Cutting Stock Problem
, 1978
"... This paper describes an important class of cutting stock problems not previously discussed in the literature. The problem is one of determining the patterns to be used in a twostage cutting process with restrictions imposed on the locations of cuts in the first stage. A particularly difficult versi ..."
Abstract
 Add to MetaCart
This paper describes an important class of cutting stock problems not previously discussed in the literature. The problem is one of determining the patterns to be used in a twostage cutting process with restrictions imposed on the locations of cuts in the first stage. A particularly difficult
Results 1  10
of
279,590