An algorithm for the constrained two-dimensional rectangular multiple identical large object placement problem

DOI10.1080/10556780701617163zbMath1180.90264OpenAlexW1976173381MaRDI QIDQ3514843

No author found.

Publication date: 23 July 2008

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780701617163

zbMATH Keywords

branch and boundpackingcuttingcutting stockconstrained two-dimensional cutting

Mathematics Subject Classification ID

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

This page was built for publication: An algorithm for the constrained two-dimensional rectangular multiple identical large object placement problem