1 citations · 3 across the 19 of their papers we have counts for
6 papers · 1 filter
Strengthening Dual Bounds for Multicommodity Capacitated Network Design with Unsplittable Flow Constraints
Lacy M. Greening, Santanu S. Dey, Alan L. Erera
Multicommodity capacitated network design (MCND) models can be used to optimize the consolidation of shipments within e-commerce fulfillment networks. In practice, fulfillment netw…
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…
Convexification of a Separable Function over a Polyhedral Ground Set
Santanu S. Dey, Burak Kocuk
In this paper, we study the set , where and the ground set is a nonempty…
Geoffrion's theorem beyond finiteness and rationality
Santanu S. Dey, Frédéric Meunier, Diego Moran Ramirez
Geoffrion's theorem is a fundamental result from mathematical programming assessing the quality of Lagrangian relaxation, a standard technique to get bounds for integer programs. A…
A second-order cone representable class of nonconvex quadratic programs
Santanu S. Dey, Aida Khajavirad
We consider the problem of minimizing a sparse nonconvex quadratic function over the unit hypercube. By developing an extension of the Reformulation-Linearization Technique (RLT) t…
Improving Full Strong Branching Decisions by Incorporating Additional Information
Prachi Shah, Santanu S. Dey
The full strong branching (FSB) rule is well known to produce extremely small branch-and-bound trees. This rule guides branching decisions based exclusively on the information rega…