Work

Extreme strong branching for QCQPs

Year: 2026

Type: article

Abstract: We propose extreme strong branching , which evaluates multiple branching points per continuous variable and jointly selects both the branching variable and point based on the objective value improvement. This approach resembles the success of strong branching for MIPs while additionally exploiting bound tightening as a byproduct. For certain types of quadratically constrained quadratic programs (QCQPs), computational experiments show that the extreme strong branching rule outperforms existing commercial solvers.

Source: Operations Research Letters

DOI: 10.1016/j.orl.2026.107446

Authors: Santanu S. Dey, Dahye Han, Yang Wang

Institution: Georgia Institute of Technology

Language: English

Topic: Advanced Optimization Algorithms Research

Subfield: Numerical Analysis

Field: Mathematics

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,960

Funders: National Science Foundation, Division of Civil, Mechanical and Manufacturing Innovation