Journal article · 2026
Code and Data Repository for Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion
INFORMS journal on computing · Published 5 November 2026 · DOI 10.1287/ijoc.2025.1330.cd
In brief
“Code and Data Repository for Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion” is a 2026 journal article by Dimitris Bertsimas and 3 co-authors, published in INFORMS journal on computing. OpenAlex counts 0 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 0
- Authors
- 4
Abstract
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. Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
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
MLA 9
Bertsimas, Dimitris, et al. “Code and Data Repository for Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion.” INFORMS journal on computing, 2026. https://doi.org/10.1287/ijoc.2025.1330.cd.
Chicago
Bertsimas, Dimitris, Ryan Cory-Wright, Sean Lo, and Jean Pauphilet. 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.
Harvard
Bertsimas, D. et al. (2026) ‘Code and Data Repository for Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion’, INFORMS journal on computing. doi:10.1287/ijoc.2025.1330.cd.
IEEE
D. Bertsimas, R. Cory-Wright, S. Lo, and J. Pauphilet, “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{bertsimas2026code,
title = {{Code and Data Repository for Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion}},
author = {Bertsimas, Dimitris and Cory-Wright, Ryan and Lo, Sean and Pauphilet, Jean},
journal = {INFORMS journal on computing},
year = {2026},
doi = {10.1287/ijoc.2025.1330.cd},
url = {https://doi.org/10.1287/ijoc.2025.1330.cd}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- low-rank matrix completion
- mixed-integer nonlinear programming
- global optimization
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
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
How many times has this paper been cited?
0 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Dimitris Bertsimas, Ryan Cory-Wright, Sean Lo, Jean Pauphilet.
What is the DOI of this paper?
10.1287/ijoc.2025.1330.cd, permanently at https://doi.org/10.1287/ijoc.2025.1330.cd. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.