285 citations · 785 across the 59 of their papers we have counts for
7 papers · 1 filter
Hyperbolic Relaxation of -Locally Positive Semidefinite Matrices
Grigoriy Blekherman, Santanu S. Dey, Kevin Shu +1
A successful computational approach for solving large-scale positive semidefinite (PSD) programs is to enforce PSD-ness on only a collection of submatrices. For our study, we let $…
Using Submodularity within Column Generation to Solve the Flight-to-Gate Assignment Problem
Yijiang Li, John-Paul Clarke, Santanu Dey
In this paper, we provide a column generation-based approach for solving the airport flight-to-gate assignment problem, where the goal is to minimize the on-ground portion of arriv…
Solving sparse principal component analysis with global support
Santanu S. Dey, Marco Molinaro, Guanyi Wang
Sparse principal component analysis with global support (SPCAgs), is the problem of finding the top- leading principal components such that all these principal components are li…
Branch-and-Bound Solves Random Binary IPs in Polytime
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
Branch-and-bound is the workhorse of all state-of-the-art mixed integer linear programming (MILP) solvers. These implementations of branch-and-bound typically use variable branchin…
A K-Nearest Neighbor Heuristic for Real-Time DC Optimal Transmission Switching
Emma S. Johnson, Shabbir Ahmed, Santanu S. Dey +1
While transmission switching is known to reduce power generation costs, the difficulty of solving even DC optimal transmission switching (DCOTS) has prevented optimal transmission…
Sparse PSD approximation of the PSD cone
Grigoriy Blekherman, Santanu S. Dey, Marco Molinaro +1
While semidefinite programming (SDP) problems are polynomially solvable in theory, it is often difficult to solve large SDP instances in practice. One technique to address this iss…