EUVIMEDEUVIMED entdecken
Crossref

Code and Data for Towards large-scale probabilistic set covering problems: an efficient Benders decomposition approach

Wei Lv, Wei-Kun Chen, Yi-Long Chen, Yu-Hong Dai

INFORMS Journal on Computing · 15.04.2026

DOI: 10.1287/ijoc.2025.1307.cd ↗

Kurz gefasst

Fachartikel in der Zeitschrift INFORMS Journal on Computing, online erschienen am 15.04.2026. Verfasst von Wei Lv und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The software and data in this repository are a snapshot of the software and data that were used in the research reported on in the paper Towards large-scale probabilistic set covering problems: an efficient Benders decomposition approach by Wei Lv, Wei-Kun Chen, Yi-Long Chen, and Yu-Hong Dai.

Zitieren

APA

Lv, W., Chen, W., Chen, Y., & Dai, Y. (2026). Code and Data for Towards large-scale probabilistic set covering problems: an efficient Benders decomposition approach. INFORMS Journal on Computing. https://doi.org/10.1287/ijoc.2025.1307.cd

Vancouver

Lv W, Chen W, Chen Y, Dai Y. Code and Data for Towards large-scale probabilistic set covering problems: an efficient Benders decomposition approach. INFORMS Journal on Computing. 2026. doi:10.1287/ijoc.2025.1307.cd

BibTeX
@article{Lv2026,
  author = {Lv, Wei and Chen, Wei-Kun and Chen, Yi-Long and Dai, Yu-Hong},
  title = {Code and Data for Towards large-scale probabilistic set covering problems: an efficient Benders decomposition approach},
  journal = {INFORMS Journal on Computing},
  year = {2026},
  doi = {10.1287/ijoc.2025.1307.cd}
}
Kostenlos starten →