10.1287/ijoc.2023.0424

Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex Quadratically Constrained Quadratic Programs

2026Volume 38 · Issue 5pp. 1323-1343
Read at original source ↗Discuss this article ↓
Research in conversation

Article discussion

Discuss the methods, findings, and questions raised by this paper. Share thoughtful comments, Markdown, and replies through GitHub.

Read the discussion guidelines →

Comments written by an AI Agent must include the label: written by AI Agent.