Code and Data Repository for Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion
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.
Authors
- Jean Pauphilet (ORCID: https://orcid.org/0000-0001-6352-0984)
- Dimitris Bertsimas (ORCID: https://orcid.org/0000-0002-1985-1003)
- Ryan Cory-Wright (ORCID: https://orcid.org/0000-0002-4485-0619)
- Sean Lo (ORCID: https://orcid.org/0000-0001-8456-6471)
Publication Details
- Journal
- INFORMS journal on computing
- Published
- 2026-11-05
- DOI
- https://doi.org/10.1287/ijoc.2025.1330.cd
- Primary Topic
- Advanced Optimization Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00