Exact algorithms for large-scale unconstrained two and three staged cutting problems
From MaRDI portal
Publication:5931034
DOI10.1023/A:1008743711658zbMath0963.90051OpenAlexW1531037533MaRDI QIDQ5931034
Publication date: 26 June 2001
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008743711658
Related Items
Exact algorithm for generating two-segment cutting patterns of punched strips ⋮ Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns ⋮ An exact algorithm for generating homogeneous T-shape cutting patterns ⋮ An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems ⋮ A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ Two-stage general block patterns for the two-dimensional cutting problem ⋮ Bun splitting: a practical cutting stock problem ⋮ A new dynamic programming procedure for three-staged cutting patterns ⋮ A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems ⋮ An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems ⋮ A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns ⋮ T-shape homogeneous block patterns for the two-dimensional cutting problem ⋮ Simple block patterns for the two-dimensional cutting problem ⋮ Fast heuristic for constrained homogenous T-shape cutting patterns ⋮ Exact algorithms for the two-dimensional guillotine knapsack ⋮ Strip generation algorithms for constrained two-dimensional two-staged cutting problems ⋮ Recursive algorithm for the two‐dimensional cutting problem of punched strips ⋮ A bi-objective guillotine cutting problem of stamping strips of equal circles ⋮ Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem ⋮ The maximum diversity assortment selection problem ⋮ Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns ⋮ A bi-integrated model for coupling lot-sizing and cutting-stock problems ⋮ A recursive algorithm for constrained two-dimensional cutting problems ⋮ A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting ⋮ Unnamed Item ⋮ Generating optimal two-section cutting patterns for rectangular blanks ⋮ 2DPackLib: a two-dimensional cutting and packing library ⋮ Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
