EUVIMEDEUVIMED entdecken
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

Weiping Pan

Array · 2026-12 · 32 · 101310

DOI: 10.1016/j.array.2026.101310 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Array, 2026-12. Verfasst von Weiping Pan. Die Arbeit nennt 23 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: National Key Research and Development Program of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Key Research and Development Program of China

Zitieren

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}
}
Kostenlos starten →