3 papers
math.OC2025
Extreme Strong Branching for QCQPs
Santanu S. Dey, Dahye Han, Yang Wang
For mixed-integer programs (MIPs), strong branching is a highly effective variable selection method to reduce the number of nodes in the branch-and-bound algorithm. Extending it to…
math.OC2024
Aggregation of Bilinear Bipartite Equality Constraints and its Application to Structural Model Updating Problem
Santanu S Dey, Dahye Han, Yang Wang
In this paper, we study the strength of convex relaxations obtained by convexification of aggregation of constraints for a set described by two bilinear bipartite equalities. A…
math.OC2024
Regularized MIP Model for Integrating Energy Storage Systems and its Application for Solving a Trilevel Interdiction Problem
Dahye Han, Nan Jiang, Santanu S. Dey +1
Incorporating energy storage systems (ESS) into power systems has been studied in many recent works, where binary variables are often introduced to model the complementary nature o…