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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Code and Data Repository for Asymptotically Tight MILP Approximations for a Non-convex QCP

Jianqiang Cheng, Boshi Yang, Kai Pan, Shiyi Jiang
INFORMS journal on computing
Blind Source Separation Techniques
article

Code and Data Repository for Asymptotically Tight MILP Approximations for a Non-convex QCP

Jianqiang Cheng, Boshi Yang, Kai Pan, Shiyi Jiang
article en

Abstract

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.

INFORMS journal on computing
Openalex Percentile: Top 92%
Blind Source Separation Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Code and Data Repository for Asymptotically Tight MILP Approximations for a Non-convex QCP — Jianqiang Cheng, Boshi Yang, et al. · INFORMS journal on computing (2025) | TGRS Research Map | TGRS