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.