activity
20022026
most citedStrong SOCP Relaxations for the Optimal Power Flow Problem

285 citations · 785 across the 59 of their papers we have counts for

collaborators

70 papers

math.OC2026

Distributed Linear Programming on GPU Clusters at Extreme Scale

Arnaud Deza, Santanu Dey, Pascal Van Hentenryck

Large linear programs can exceed the memory of a single compute node. Although first-order methods replace sparse factorizations with GPU-suited matrix-vector products, other solve…

math.OC2026

Decomposition of Sparse Integer Programs via Nonlinear Edge Encodings and Column-and-Row Generation

Gustavo Angulo, Santanu S. Dey

A wide range of sparse integer programs admit a block structure in which subproblems interact through a small set of shared variables. Dualizing the linking equalities yields a dec…

math.FA2026

The Skew Commutators of Toeplitz and Hankel operators in vector-valued Hardy Space

Priyanka Aroda, Santanu Dey

In this article, we characterize when a Toeplitz operator and a Hankel operator on the vector-valued Hardy space are skew commutators of each other, and determine necessary and suf…

math.OC2024

Non-Monotonicity of Branching Rules with respect to Linear Relaxations

Prachi Shah, Santanu S. Dey, Marco Molinaro

Modern mixed-integer programming solvers use the branch-and-cut framework, where cutting planes are added to improve the tightness of the linear programming (LP) relaxation, with t…

math.OC2023

A reformulation-enumeration MINLP algorithm for gas network design

Yijiang Li, Santanu S. Dey, Nikolaos V. Sahinidis

Gas networks are used to transport natural gas, which is an important resource for both residential and industrial customers throughout the world. The gas network design problem is…

math.FA2023

Characteristic Functions and Colligations

Neeru Bala, Santanu Dey, Kalpesh J. Haria +1

The characteristic function of row contractions and the characteristic function of liftings of row contractions are multi-analytic operators which are complete invariants up to uni…