UGC: An algorithm for two-stage unconstrained guillotine cutting

DOI10.1016/0377-2217(94)00347-FzbMath0953.90567OpenAlexW1997624473MaRDI QIDQ1127189

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)

Cites Work

• An algorithm for the solution of the 0-1 knapsack problem
• Unnamed Item

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