EUVIMEDEUVIMED entdecken
Crossref

EATKG: An Open-Source Efficient Exact Algorithm for the Two-Dimensional Knapsack Problem with Guillotine Constraints

Sunkanghong Wang, Roberto Baldacci, Qiang Liu, Lijun Wei

European Journal of Operational Research · 2025-12 · 327 (3) · 735-753

DOI: 10.1016/j.ejor.2025.05.033 ↗

Kurz gefasst

Fachartikel in der Zeitschrift European Journal of Operational Research, 2025-12. Verfasst von Sunkanghong Wang und 3 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 72 Literaturangaben. Gefördert von: Guangzhou Municipal Science and Technology Program key projects, Natural Science Foundation of Guangdong Province, National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Guangzhou Municipal Science and Technology Program key projects
  • Natural Science Foundation of Guangdong Province
  • National Natural Science Foundation of China
  • Science Fund for Distinguished Young Scholars of Guangdong Province

Zitieren

APA

Wang, S., Baldacci, R., Liu, Q., & Wei, L. (2025). EATKG: An Open-Source Efficient Exact Algorithm for the Two-Dimensional Knapsack Problem with Guillotine Constraints. European Journal of Operational Research, 327(3), 735-753. https://doi.org/10.1016/j.ejor.2025.05.033

Vancouver

Wang S, Baldacci R, Liu Q, Wei L. EATKG: An Open-Source Efficient Exact Algorithm for the Two-Dimensional Knapsack Problem with Guillotine Constraints. European Journal of Operational Research. 2025;327(3):735-753. doi:10.1016/j.ejor.2025.05.033

BibTeX
@article{Wang2025,
  author = {Wang, Sunkanghong and Baldacci, Roberto and Liu, Qiang and Wei, Lijun},
  title = {EATKG: An Open-Source Efficient Exact Algorithm for the Two-Dimensional Knapsack Problem with Guillotine Constraints},
  journal = {European Journal of Operational Research},
  year = {2025},
  volume = {327},
  number = {3},
  pages = {735--753},
  doi = {10.1016/j.ejor.2025.05.033}
}
Kostenlos starten →