13 citations · 27 across the 4 of their papers we have counts for
6 papers
A study of rank-one sets with linear side constraints and application to the pooling problem
Santanu S. Dey, Burak Kocuk, Asteroide Santana
We study sets defined as the intersection of a rank-1 constraint with different choices of linear side constraints. We identify different conditions on the linear side constraints,…
The convex hull of a quadratic constraint over a polytope
Asteroide Santana, Santanu S. Dey
A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadra…
On Subadditive Duality for Conic Mixed-Integer Programs
Burak Kocuk, Diego Moran
In this paper, we show that the subadditive dual of a feasible conic mixed-integer program (MIP) is a strong dual whenever it is feasible. Moreover, we show that this dual feasibil…
New SOCP relaxation and branching rule for bipartite bilinear programs
Santanu S. Dey, Asteroide Santana, Yang Wang
A bipartite bilinear program (BBP) is a quadratically constrained quadratic optimization problem where the variables can be partitioned into two sets such that fixing the variables…
A Bayesian framework for molecular strain identification from mixed diagnostic samples
Lauri Mustonen, Xiangxi Gao, Asteroide Santana +3
We provide a mathematical formulation and develop a computational framework for identifying multiple strains of microorganisms from mixed samples of DNA. Our method is applicable i…
Some cut-generating functions for second-order conic sets
Asteroide Santana, Santanu S. Dey
In this paper, we study cut generating functions for conic sets. Our first main result shows that if the conic set is bounded, then cut generating functions for integer linear prog…