EUVIMEDEUVIMED entdecken
Crossref

Code and Data Repository for Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion

Dimitris Bertsimas, Ryan Cory-Wright, Sean Lo, Jean Pauphilet

INFORMS Journal on Computing · 05.11.2026

DOI: 10.1287/ijoc.2025.1330.cd ↗

Kurz gefasst

Fachartikel in der Zeitschrift INFORMS Journal on Computing, online erschienen am 05.11.2026. Verfasst von Dimitris Bertsimas und 3 weiteren Autor:innen.

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 Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion by D. Bertsimas, R. Cory-Wright, S. Lo, and J. Pauphilet. The snapshot is based on this SHA in the development repository.

Zitieren

APA

Bertsimas, D., Cory-Wright, R., Lo, S., & Pauphilet, J. (2026). Code and Data Repository for Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion. INFORMS Journal on Computing. https://doi.org/10.1287/ijoc.2025.1330.cd

Vancouver

Bertsimas D, Cory-Wright R, Lo S, Pauphilet J. Code and Data Repository for Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion. INFORMS Journal on Computing. 2026. doi:10.1287/ijoc.2025.1330.cd

BibTeX
@article{Bertsimas2026,
  author = {Bertsimas, Dimitris and Cory-Wright, Ryan and Lo, Sean and Pauphilet, Jean},
  title = {Code and Data Repository for Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion},
  journal = {INFORMS Journal on Computing},
  year = {2026},
  doi = {10.1287/ijoc.2025.1330.cd}
}
Kostenlos starten →