UGC: An algorithm for two-stage unconstrained guillotine cutting

DOI10.1016/0377-2217(94)00347-FMaRDI QIDQ1127189zbMATH OpenOpenAlexFDO

Authors Ann Van Der Wilt

Publication date 5 May 1999

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(94)00347-f

zbMATH Keywords

branch-and-boundknapsack problemstwo-dimensional cutting

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• An algorithm for the 2D guillotine cutting stock problem
• An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
• A recursive algorithm for constrained two-dimensional cutting problems

Cites work

• scientific article; zbMATH DE number 444958 (Why is no real title available?)
• An algorithm for the solution of the 0-1 knapsack problem

Cited in

(3)

• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
• On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns

This page was built for publication: UGC: An algorithm for two-stage unconstrained guillotine cutting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127189)