EUVIMEDEUVIMED entdecken
Crossref

Code and Data Repository for Tight low complexity approximation for the Qm||Cmax problem via mathematical programming modeling

Luca Savant Aira, Rosario Scatamacchia, Federico Della Croce Di Dojola

INFORMS Journal on Computing · 27.07.2026

DOI: 10.1287/ijoc.2025.1129.cd ↗

Kurz gefasst

Fachartikel in der Zeitschrift INFORMS Journal on Computing, online erschienen am 27.07.2026. Verfasst von Luca Savant Aira und 2 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 Tight low complexity approximation for the $Qm||C_{max}$ problem via mathematical programming modeling by L. Savant Aira, R. Scatamacchia, and F. Della Croce.

Zitieren

APA

Aira, L. S., Scatamacchia, R., & Dojola, F. D. C. D. (2026). Code and Data Repository for Tight low complexity approximation for the Qm||Cmax problem via mathematical programming modeling. INFORMS Journal on Computing. https://doi.org/10.1287/ijoc.2025.1129.cd

Vancouver

Aira LS, Scatamacchia R, Dojola FDCD. Code and Data Repository for Tight low complexity approximation for the Qm||Cmax problem via mathematical programming modeling. INFORMS Journal on Computing. 2026. doi:10.1287/ijoc.2025.1129.cd

BibTeX
@article{Aira2026,
  author = {Aira, Luca Savant and Scatamacchia, Rosario and Dojola, Federico Della Croce Di},
  title = {Code and Data Repository for Tight low complexity approximation for the Qm||Cmax problem via mathematical programming modeling},
  journal = {INFORMS Journal on Computing},
  year = {2026},
  doi = {10.1287/ijoc.2025.1129.cd}
}
Kostenlos starten →