An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems

DOI10.1287/opre.1040.0154zbMath1165.90539OpenAlexW2113567319MaRDI QIDQ5322078

Rym M'Hallah, Mhand Hifi

Publication date: 17 July 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1040.0154

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem ⋮ An exact algorithm for generating homogeneous T-shape cutting patterns ⋮ Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory ⋮ Heuristic for constrained T-shape cutting patterns of rectangular pieces ⋮ Bun splitting: a practical cutting stock problem ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ 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 ⋮ Simple block patterns for the two-dimensional cutting problem ⋮ Exact algorithms for the two-dimensional guillotine knapsack ⋮ A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem ⋮ A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting ⋮ Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns

This page was built for publication: An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems