Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Bertsimas et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: