Results 211 to 220 of about 39,747 (262)
Some of the next articles are maybe not open access.
On ‘Two-Dimensional Cutting Stock with Multiple Stock Sizes’
Journal of the Operational Research Society, 1992[No abstract available]
openaire +1 more source
An integrated cutting stock and sequencing problem
European Journal of Operational Research, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Horacio Hideki Yanasse +1 more
openaire +2 more sources
2005
Column generation has been proposed by Gilmore and Gomory to solve cutting stock problem, independently of Dantzig-Wolfe decomposition. We survey the basic models proposed for cutting stock and the corresponding solution approaches. Extended Dantzig-Wolfe decomposition is surveyed and applied to these models in order to show the links to Gilmore-Gomory
Hatem Ben Amor +1 more
openaire +2 more sources
Column generation has been proposed by Gilmore and Gomory to solve cutting stock problem, independently of Dantzig-Wolfe decomposition. We survey the basic models proposed for cutting stock and the corresponding solution approaches. Extended Dantzig-Wolfe decomposition is surveyed and applied to these models in order to show the links to Gilmore-Gomory
Hatem Ben Amor +1 more
openaire +2 more sources
Efficient stock cutting for laminated manufacturing
Computer-Aided Design, 2002Abstract When an object is made using Laminated Manufacturing (LM), the output is a rectangular block with the required object trapped inside. In order to enable extraction of the object, the remaining sheet in each layer is cut into square grids that grow into tiny tiles.
K. P. Karunakaran +4 more
openaire +2 more sources
Tighter relaxations for the cutting stock problem
European Journal of Operational Research, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christoph Nitsche +2 more
openaire +2 more sources
Solving Binary Cutting Stock with Matheuristics
2014Many Combinatorial Optimization (CO) problems are classifed as NP - complete problems. The process of solving CO problems in an efficient manner is important since several industry, government and scientific problems can be statedin this form. This work presents a benchmark of three different methodologies to solve the Binary Cutting Stock (BCS ...
Ivan Adrian Lopez Sanchez +3 more
openaire +1 more source
A note on the approximability of cutting stock problems
European Journal of Operational Research, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
G. F. Cintra +3 more
openaire +1 more source
Cutting knife limitations in cutting stock problems
2022This thesis was scanned from the print manuscript for digital preservation and is copyright the author. Researchers can access this thesis by asking their local university, institution or public library to make a request on their behalf. Monash staff and postgraduate students can use the link in the References field.
openaire +1 more source
The cutting stock problem and integer rounding
Mathematical Programming, 1985The cutting stock problem (CS) min \(1\cdot y\), s.t. yM\(\geq w\), \(y\geq 0\), y integral, is strongly related to the knapsack problem (KP) max \(c\cdot x\), s.t. \(a\cdot x\leq b\), \(x\geq 0\), integral, by taking M as the matrix (of rows) of the maximal element of \(\{x\in {\mathbb{Z}}^ n_+|\) ax\(\leq b\}\). It was observed that the solutions of (
openaire +2 more sources
Romanian software's for cutting stock problems
Proceedings of the 5th international conference on Computer systems and technologies - CompSysTech '04, 2004After a short presentation of the author's contribution in the Cutting stock problems (CPP) solving, we shell present shortly too the contribution of other Romanian peoples based on published and only presented papers in the field of CCP-software The software elaboration and some industrial application are also presented.
openaire +1 more source