EUVIMEDEUVIMED entdecken
Crossref

Cost-sharing mechanisms for the selfish maximum open-end bin packing problem

Zhikang Zhang, Weidong Li

Computers & Operations Research · 2026-07 · 191 · 107468

DOI: 10.1016/j.cor.2026.107468 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computers & Operations Research, 2026-07. Verfasst von Zhikang Zhang und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 33 Literaturangaben. Gefördert von: Yunnan University.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Yunnan University

Zitieren

APA

Zhang, Z., & Li, W. (2026). Cost-sharing mechanisms for the selfish maximum open-end bin packing problem. Computers & Operations Research, 191, 107468. https://doi.org/10.1016/j.cor.2026.107468

Vancouver

Zhang Z, Li W. Cost-sharing mechanisms for the selfish maximum open-end bin packing problem. Computers & Operations Research. 2026;191:107468. doi:10.1016/j.cor.2026.107468

BibTeX
@article{Zhang2026,
  author = {Zhang, Zhikang and Li, Weidong},
  title = {Cost-sharing mechanisms for the selfish maximum open-end bin packing problem},
  journal = {Computers & Operations Research},
  year = {2026},
  volume = {191},
  pages = {107468},
  doi = {10.1016/j.cor.2026.107468}
}
Kostenlos starten →