Open access · CC BY-NC-ND 4.0
An optimization algorithm for large-scale 2D guillotine cutting stock problem based on corner-occupying nesting pattern
Array · 2026-12 · 32 · 101310
DOI: 10.1016/j.array.2026.101310 ↗At a glance
Journal article in Array, 2026-12. Written by Weiping Pan. 23 references. The full text is freely available (open access, CC BY-NC-ND 4.0). Funded by: National Key Research and Development Program of China.
Abstract (original language)
Abstract non disponibile.
Funding
- National Key Research and Development Program of China
Cite
APA
Pan, W. (2026). An optimization algorithm for large-scale 2D guillotine cutting stock problem based on corner-occupying nesting pattern. Array, 32, 101310. https://doi.org/10.1016/j.array.2026.101310
Vancouver
Pan W. An optimization algorithm for large-scale 2D guillotine cutting stock problem based on corner-occupying nesting pattern. Array. 2026;32:101310. doi:10.1016/j.array.2026.101310
BibTeX
@article{Pan2026,
author = {Pan, Weiping},
title = {An optimization algorithm for large-scale 2D guillotine cutting stock problem based on corner-occupying nesting pattern},
journal = {Array},
year = {2026},
volume = {32},
pages = {101310},
doi = {10.1016/j.array.2026.101310}
}
EUVIMED