Abrahamsen, Mikkel; Miltzow, Tillmann; Seiferth, Nadja Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems. (English) Zbl 07875515 TheoretiCS 3, Paper No. 11, 78 p. (2024). MSC: 68-XX × Cite Format Result Cite Review PDF Full Text: DOI arXiv OA License
Khan, Arindam; Sharma, Eklavya Tight approximation algorithms for geometric bin packing with skewed items. (English) Zbl 07742469 Algorithmica 85, No. 9, 2735-2778 (2023). MSC: 68Wxx 05Cxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
De Armas, Jesica; Miranda, Gara; León, Coromoto Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem. (English) Zbl 1244.90009 Eur. J. Oper. Res. 219, No. 2, 201-213 (2012). MSC: 90-04 68W10 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Burke, E. K.; Hellier, R. S. R.; Kendall, G.; Whitwell, G. Complete and robust no-fit polygon generation for the irregular stock cutting problem. (English) Zbl 1175.90325 Eur. J. Oper. Res. 179, No. 1, 27-49 (2007). MSC: 90C27 65D18 52A39 68U05 × Cite Format Result Cite Review PDF Full Text: DOI
Milenkovic, Victor J. Densest translational lattice packing of non-convex polygons. (English) Zbl 1016.68146 Comput. Geom. 22, No. 1-3, 205-222 (2002). MSC: 68U05 × Cite Format Result Cite Review PDF Full Text: DOI
McDiarmid, Colin Pattern minimisation in cutting stock problems. (English) Zbl 0987.90085 Discrete Appl. Math. 98, No. 1-2, 121-130 (1999). MSC: 90C35 90C39 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI
Daniels, Karen; Milenkovic, Victor J. Column-based strip packing using ordered and compliant containment. (English) Zbl 1541.68385 Lin, Ming C. (ed.) et al., Applied computational geometry. Towards geometric engineering. FCRC ’96 workshop, WACG ’96, Philadelphia, PA, USA, May 27–28, 1996. Selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 1148, 91-107 (1996). MSC: 68U05 90C59 × Cite Format Result Cite Review PDF Full Text: DOI