Code and Data Repository for Asymptotically Tight MILP Approximations for a Non-convex QCP
The goal of this repository is to share data and results related to the non-convex quadratically constrained program (QCP), solved using our asymptotically tight mixed-integer linear programming (MILP) approximations.
Authors
- Jianqiang Cheng (ORCID: https://orcid.org/0000-0003-3358-9176)
- Boshi Yang (ORCID: https://orcid.org/0000-0001-6760-9054)
- Kai Pan (ORCID: https://orcid.org/0000-0003-2127-5348)
- Shiyi Jiang (ORCID: https://orcid.org/0000-0002-9766-3518)
Publication Details
- Journal
- INFORMS journal on computing
- Published
- 2025-04-09
- DOI
- https://doi.org/10.1287/ijoc.2024.0719.cd
- Primary Topic
- Blind Source Separation Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00