Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
From MaRDI portal
Publication:5952054
DOI10.1023/A:1011628809603zbMath1135.90389OpenAlexW1547093138MaRDI QIDQ5952054
Mhand Hifi, Catherine Roucairol
Publication date: 8 January 2002
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011628809603
dynamic programmingcombinatorial optimizationoptimalitycutting problemssingle knapsack problemstock rectangle
Related Items (22)
A block-based layer building approach for the 2D guillotine strip packing problem ⋮ Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns ⋮ An exact algorithm for generating homogeneous T-shape cutting patterns ⋮ Models for the two-dimensional two-stage cutting stock problem with multiple stock size ⋮ An integrated cutting stock and sequencing problem ⋮ Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ Solving a large cutting problem in the glass manufacturing industry ⋮ Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry ⋮ Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming ⋮ A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems ⋮ A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns ⋮ Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds ⋮ An enumeration scheme to generate constrained exact checkerboard patterns ⋮ An exact algorithm for the knapsack sharing problem ⋮ Strip generation algorithms for constrained two-dimensional two-staged cutting problems ⋮ An integer programming model for two- and three-stage two-dimensional cutting stock problems ⋮ A note on linear models for two-group and three-group two-dimensional guillotine cutting problems ⋮ Two-stage two-dimensional guillotine cutting stock problems with usable leftover ⋮ Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais ⋮ Linear models for 1-group two-dimensional guillotine cutting problems ⋮ A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
This page was built for publication: Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
