Santanu Subhas Dey
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Santanu Subhas Dey has a total of 131 co-authors. Here are the top co-authors by number of shared publications:
- Marco Molinaro
Microsoft Research, Redmond, WA, USA and PUC-Rio, Rio de Janeiro, RJ, Brazil
11 shared publications - Guanyi Wang
School of Industrial and Systems Engineering Operations Research Center School of Industrial and Systems Engineering Georgia Institute of Technology Massachusetts Institute of Technology Georgia Institute of Technology
9 shared publications - Burak Kocuk
Industrial Engineering Program Sabancı University 34956 Istanbul Turkey
8 shared publications - Shabbir Ahmed
Georgia Institute of Technology, Atlanta, USA
8 shared publications - Alberto Del Pia
Department of Industrial and Systems Engineering & Wisconsin Institute for Discovery, University of Wisconsin-Madison, Madison, USA
7 shared publications - Asteroide Santana
Georgia Institute of Technology
6 shared publications
Latest Publications
- 1 May 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 38 (3) , 729-744
Regularized MIP Model for Integrating Energy Storage Systems and Its Application for Solving a Trilevel Interdiction Problem
In modeling battery energy storage systems (BESS) in power systems, binary variables are used to represent the complementary nature of charging and discharging. A conventional approach for these BESS optimization problems is to relax binary variables and convert the problem into a linear program. However, such linear programming relaxation models can yield unrealistic fractional solutions, such as simultaneous charging and discharging. In this paper, we develop a regularized mixed-integer programming (MIP) model for the optimal power flow (OPF) problem with BESS. We prove that, under mild conditions, the proposed regularized model admits a zero integrality gap with its linear programming relaxation; hence, it can be solved efficiently. By studying the properties of the regularized MIP model, we show that its optimal solution is also near optimal to the original OPF problem with BESS, thereby providing a valid and tight upper bound for the OPF problem with BESS. The use of the regularized MIP model allows us to solve a trilevel [ ]-[ ]-[ ] network contingency problem, which is otherwise intractable to solve. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms–Discrete. Funding: N. Jiang (as a graduate student at the Georgia Institute of Technology) and W. Xie were supported in part by the National Science Foundation [Grant 2246414] and the Office of Naval Research [Grant N00014-24-1-2066]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0771 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0771 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 May 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 38 (3) , 729-744
Regularized MIP Model for Integrating Energy Storage Systems and Its Application for Solving a Trilevel Interdiction Problem
In modeling battery energy storage systems (BESS) in power systems, binary variables are used to represent the complementary nature of charging and discharging. A conventional approach for these BESS optimization problems is to relax binary variables and convert the problem into a linear program. However, such linear programming relaxation models can yield unrealistic fractional solutions, such as simultaneous charging and discharging. In this paper, we develop a regularized mixed-integer programming (MIP) model for the optimal power flow (OPF) problem with BESS. We prove that, under mild conditions, the proposed regularized model admits a zero integrality gap with its linear programming relaxation; hence, it can be solved efficiently. By studying the properties of the regularized MIP model, we show that its optimal solution is also near optimal to the original OPF problem with BESS, thereby providing a valid and tight upper bound for the OPF problem with BESS. The use of the regularized MIP model allows us to solve a trilevel [ ]-[ ]-[ ] network contingency problem, which is otherwise intractable to solve. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms–Discrete. Funding: N. Jiang (as a graduate student at the Georgia Institute of Technology) and W. Xie were supported in part by the National Science Foundation [Grant 2246414] and the Office of Naval Research [Grant N00014-24-1-2066]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0771 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0771 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- Open Access
- 24 April 2026
- Published by Elsevier in SSRN Electronic Journal
Charging Station Placement Optimization for Electric Vehicles Integrated with Public Transit
We develop a methodology to identify where to locate electric vehicle chargers in a city to maximize commuter convenience. The model incorporates information on commuter travel from home to work and the possibility for commuters to use public transportation. Apart from the optimal location of the charger stations, our methodology can be used to answer questions such as the effect of increasing rail use, the benefits of expanding rail infrastructure, and the efficacy of park-charge-ride systems. The model can also be used to find the right portfolio to minimize transportation energy requirements. We illustrate our methodology by applying it to the city of Atlanta. We find that total electricity requirements for commuting can be reduced from about 1 gigawatt to about 0.8 gigawatts through integration of electric vehicle commuting with bus and rail transit.
- 24 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessCharging Station Placement Optimization for Electric Vehicles Integrated with Public Transit
We develop a methodology to identify where to locate electric vehicle chargers in a city to maximize commuter convenience. The model incorporates information on commuter travel from home to work and the possibility for commuters to use public transportation. Apart from the optimal location of the charger stations, our methodology can be used to answer questions such as the effect of increasing rail use, the benefits of expanding rail infrastructure, and the efficacy of park-charge-ride systems. The model can also be used to find the right portfolio to minimize transportation energy requirements. We illustrate our methodology by applying it to the city of Atlanta. We find that total electricity requirements for commuting can be reduced from about 1 gigawatt to about 0.8 gigawatts through integration of electric vehicle commuting with bus and rail transit.
- Open Access
- 17 April 2026
- Published by Elsevier in SSRN Electronic Journal
Charging Station Placement Optimization for Electric Vehicles
We develop a methodology to identify where to locate electric vehicle chargers in a city to maximizecommuterconvenience.Themodelincorporatesinformation oncommutertravel from home to work and the possibility for commuters to use public transportation. Apart from the optimal location of the charger stations, our methodology can be used to answer questions such as the effect of increasing rail use, the benefits of expanding rail infrastructure, and the efficacy of park-charge-ride systems. The model can also be used to find the right portfolio to minimize transportation energy requirements. We illustrate our methodology by applying it to the city of Atlanta. We find that total electricity requirements for commuting can be reduced from about 1 GWtoabout0.8 GWthroughintegration of EV commuting with bus and rail transit. Expanding the rail system infrastructure does not provide significant energy saving. Increasing the number buses is more effective than increasing the number of rail cars in serving more commuters with a fixed budget for charging stations.
- 17 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessCharging Station Placement Optimization for Electric Vehicles
We develop a methodology to identify where to locate electric vehicle chargers in a city to maximizecommuterconvenience.Themodelincorporatesinformation oncommutertravel from home to work and the possibility for commuters to use public transportation. Apart from the optimal location of the charger stations, our methodology can be used to answer questions such as the effect of increasing rail use, the benefits of expanding rail infrastructure, and the efficacy of park-charge-ride systems. The model can also be used to find the right portfolio to minimize transportation energy requirements. We illustrate our methodology by applying it to the city of Atlanta. We find that total electricity requirements for commuting can be reduced from about 1 GWtoabout0.8 GWthroughintegration of EV commuting with bus and rail transit. Expanding the rail system infrastructure does not provide significant energy saving. Increasing the number buses is more effective than increasing the number of rail cars in serving more commuters with a fixed budget for charging stations.
- Open Access
- 11 April 2026
- Published by Springer Nature in Journal of Global Optimization
- Vol. 94 (4) , 1099-1135
Aggregation of bilinear bipartite equality constraints and its application to structural model updating problem
In this paper, we study the strength of convex relaxations obtained by convexification of aggregation of constraints for a set S described by two bilinear bipartite equalities. Aggregation is the process of rescaling the original constraints by scalar weights and adding the scaled constraints together. It is natural to study the aggregation technique as it yields a single bilinear bipartite equality whose convex hull is already understood from previous literature. On the theoretical side, we present sufficient conditions when $$\text {conv} (S)$$ can be described by the intersection of convex hulls of a finite number of aggregations, examples when $$\text {conv} (S)$$ can only be obtained as the intersection of the convex hull of an infinite number of aggregations, and examples when $$\text {conv} (S)$$ cannot be achieved exactly from the process of aggregation. Computationally, we explore different methods to derive aggregation weights in order to obtain tight convex relaxations. We show that even if an exact convex hull may not be achieved using aggregations, including the convex hull of an aggregation often significantly tightens the outer approximation of $$\text {conv} (S)$$ . Finally, we apply the aggregation method to obtain convex relaxation for the structural model updating problem and show that this yields better bounds within a branch-and-bound tree as compared to not using aggregations.- 11 April 2026
- Published by Springer Nature in Journal of Global Optimization
- Vol. 94 (4) , 1099-1135
Open AccessAggregation of bilinear bipartite equality constraints and its application to structural model updating problem
In this paper, we study the strength of convex relaxations obtained by convexification of aggregation of constraints for a set S described by two bilinear bipartite equalities. Aggregation is the process of rescaling the original constraints by scalar weights and adding the scaled constraints together. It is natural to study the aggregation technique as it yields a single bilinear bipartite equality whose convex hull is already understood from previous literature. On the theoretical side, we present sufficient conditions when $$\text {conv} (S)$$ can be described by the intersection of convex hulls of a finite number of aggregations, examples when $$\text {conv} (S)$$ can only be obtained as the intersection of the convex hull of an infinite number of aggregations, and examples when $$\text {conv} (S)$$ cannot be achieved exactly from the process of aggregation. Computationally, we explore different methods to derive aggregation weights in order to obtain tight convex relaxations. We show that even if an exact convex hull may not be achieved using aggregations, including the convex hull of an aggregation often significantly tightens the outer approximation of $$\text {conv} (S)$$ . Finally, we apply the aggregation method to obtain convex relaxation for the structural model updating problem and show that this yields better bounds within a branch-and-bound tree as compared to not using aggregations. - 16 February 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 334 (2) , 496-508
Strengthening dual bounds for multicommodity capacitated network design with unsplittable flow constraints
- 16 February 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 334 (2) , 496-508
Strengthening dual bounds for multicommodity capacitated network design with unsplittable flow constraints
- 1 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 38 (1) , 53-66
Non-Monotonicity of Branching Rules with Respect to Linear Relaxations
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 the expectation that the tighter formulation would produce smaller branch-and-bound trees. In this work, we consider the question of whether adding cuts will always lead to smaller trees for a given fixed branching rule. We formally call such a property of a branching rule monotonicity. We prove that any branching rule which exclusively branches on fractional variables in the LP solution is nonmonotonic. Moreover, we present a family of instances where adding a single cut leads to an exponential increase in the size of full strong branching trees, despite improving the LP bound. Finally, we empirically attempt to estimate the prevalence of nonmonotonicity in practice while using full strong branching. We consider randomly generated multidimensional knapsacks tightened by cover cuts as well as instances from the MIPLIB 2017 benchmark set for the computational experiments. Our main insight from these experiments is that if the gap closed by cuts is small, change in tree size is difficult to predict, and often increases, possibly due to inherent nonmonotonicity. However, when a sufficiently large gap is closed, a significant decrease in tree size may be expected. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms—Discrete. Funding: This work was supported by Air Force Office of Scientific Research [Grant F9550-22-1-0052]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0709 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0709 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 38 (1) , 53-66
Non-Monotonicity of Branching Rules with Respect to Linear Relaxations
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 the expectation that the tighter formulation would produce smaller branch-and-bound trees. In this work, we consider the question of whether adding cuts will always lead to smaller trees for a given fixed branching rule. We formally call such a property of a branching rule monotonicity. We prove that any branching rule which exclusively branches on fractional variables in the LP solution is nonmonotonic. Moreover, we present a family of instances where adding a single cut leads to an exponential increase in the size of full strong branching trees, despite improving the LP bound. Finally, we empirically attempt to estimate the prevalence of nonmonotonicity in practice while using full strong branching. We consider randomly generated multidimensional knapsacks tightened by cover cuts as well as instances from the MIPLIB 2017 benchmark set for the computational experiments. Our main insight from these experiments is that if the gap closed by cuts is small, change in tree size is difficult to predict, and often increases, possibly due to inherent nonmonotonicity. However, when a sufficiently large gap is closed, a significant decrease in tree size may be expected. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms—Discrete. Funding: This work was supported by Air Force Office of Scientific Research [Grant F9550-22-1-0052]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0709 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0709 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 29 November 2025
- Published by Elsevier in Operations Research Letters
- Vol. 65
Geoffrion’s theorem beyond finiteness and rationality
- 29 November 2025
- Published by Elsevier in Operations Research Letters
- Vol. 65
Geoffrion’s theorem beyond finiteness and rationality
- Open Access
Extreme Strong Branching for QCQPs
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 nonlinear problems is conceptually simple but practically limited. Branching on a binary variable fixes the variable to 0 or 1, whereas branching on a continuous variable requires an additional decision to choose a branching point. Previous extensions of strong branching predefine this point and then solve $2n$ relaxations where $n$ is the number of candidate variables to branch. We propose extreme strong branching, which evaluates multiple branching points per variable and jointly selects both the branching variable and point based on the objective value improvement. This approach resembles the success of strong branching for MIPs while additionally exploiting bound tightening as a byproduct. For certain types of quadratically constrained quadratic programs (QCQPs), computational experiments show that the extreme strong branching rule outperforms existing commercial solvers.Open AccessExtreme Strong Branching for QCQPs
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 nonlinear problems is conceptually simple but practically limited. Branching on a binary variable fixes the variable to 0 or 1, whereas branching on a continuous variable requires an additional decision to choose a branching point. Previous extensions of strong branching predefine this point and then solve $2n$ relaxations where $n$ is the number of candidate variables to branch. We propose extreme strong branching, which evaluates multiple branching points per variable and jointly selects both the branching variable and point based on the objective value improvement. This approach resembles the success of strong branching for MIPs while additionally exploiting bound tightening as a byproduct. For certain types of quadratically constrained quadratic programs (QCQPs), computational experiments show that the extreme strong branching rule outperforms existing commercial solvers. - Open Access
Convexification of a Separable Function over a Polyhedral Ground Set
In this paper, we study the set $\mathcal{S}^κ= \{ (x,y)\in\mathcal{G}\times\mathbb{R}^n : y_j = x_j^κ, j=1,\dots,n\}$, where $κ> 1$ and the ground set $\mathcal{G}$ is a nonempty polytope contained in $[0,1]^n$. This nonconvex set is closely related to separable standard quadratic programming and appears as a substructure in potential-based network flow problems from gas and water networks. Our aim is to obtain the convex hull of $\mathcal{S}^κ$ or its tight outer-approximation for the special case when the ground set $\mathcal{G}$ is the standard simplex. We propose power cone, second-order cone and semidefinite programming relaxations for this purpose, which are further strengthened by the Reformulation-Linearization Technique and the Reformulation-Perspectification Technique. For $κ=2$, we obtain the convex hull of $\mathcal{S}^κ$ in the low-dimensional setting. For general $κ$, we give approximation guarantees for the power cone representable relaxation, the weakest relaxation we consider. We prove that this weakest relaxation is tight with probability one as $n\to\infty$ when a uniformly generated linear objective is optimized over it. Finally, we provide the results of our extensive computational experiments comparing the empirical strength of several conic programming relaxations that we propose.Open AccessConvexification of a Separable Function over a Polyhedral Ground Set
In this paper, we study the set $\mathcal{S}^κ= \{ (x,y)\in\mathcal{G}\times\mathbb{R}^n : y_j = x_j^κ, j=1,\dots,n\}$, where $κ> 1$ and the ground set $\mathcal{G}$ is a nonempty polytope contained in $[0,1]^n$. This nonconvex set is closely related to separable standard quadratic programming and appears as a substructure in potential-based network flow problems from gas and water networks. Our aim is to obtain the convex hull of $\mathcal{S}^κ$ or its tight outer-approximation for the special case when the ground set $\mathcal{G}$ is the standard simplex. We propose power cone, second-order cone and semidefinite programming relaxations for this purpose, which are further strengthened by the Reformulation-Linearization Technique and the Reformulation-Perspectification Technique. For $κ=2$, we obtain the convex hull of $\mathcal{S}^κ$ in the low-dimensional setting. For general $κ$, we give approximation guarantees for the power cone representable relaxation, the weakest relaxation we consider. We prove that this weakest relaxation is tight with probability one as $n\to\infty$ when a uniformly generated linear objective is optimized over it. Finally, we provide the results of our extensive computational experiments comparing the empirical strength of several conic programming relaxations that we propose. - Open Access
Improving Full Strong Branching Decisions by Incorporating Additional Information
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 regarding local gains in the linear programming (LP) bounds. We identify and correct two key shortcomings in FSB. First, the LP gains may be overestimations of the improvement in global dual bounds whenever pruning is possible. We propose a modification to address this issue, that incorporates primal bounds and readjusts the relative importance of the larger and smaller LP gains. Second, FSB decisions may be myopic as they consider only local LP gains and cannot foresee the impact of branching decisions on feasibility or integrality beyond immediate children. To address this weakness, we present an approach that detects global asymmetry trends in infeasibility and integrality due to 0 and 1 assignments and incorporates them into the FSB score function. We further extend this approach to achieve more balanced trees even when the branch-and-bound tree prunes primarily by bounds. Using randomly generated problem instances with known structures, we derive insights and fine-tune our modified scores. Evaluation on MIPLIB 2017 Benchmark instances shows a 22-35\% reduction in mean tree sizes for solved cases and a 3.6-5.6\% decrease in the remaining gap for unsolved ones. Our approach extends to reliability branching (RB), where improved scores reduce mean tree sizes by 5-13\% on solved instances and lower the mean gap by 2.6-4.3\% on unsolved instances, depending on primal bound quality.
Open AccessImproving Full Strong Branching Decisions by Incorporating Additional Information
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 regarding local gains in the linear programming (LP) bounds. We identify and correct two key shortcomings in FSB. First, the LP gains may be overestimations of the improvement in global dual bounds whenever pruning is possible. We propose a modification to address this issue, that incorporates primal bounds and readjusts the relative importance of the larger and smaller LP gains. Second, FSB decisions may be myopic as they consider only local LP gains and cannot foresee the impact of branching decisions on feasibility or integrality beyond immediate children. To address this weakness, we present an approach that detects global asymmetry trends in infeasibility and integrality due to 0 and 1 assignments and incorporates them into the FSB score function. We further extend this approach to achieve more balanced trees even when the branch-and-bound tree prunes primarily by bounds. Using randomly generated problem instances with known structures, we derive insights and fine-tune our modified scores. Evaluation on MIPLIB 2017 Benchmark instances shows a 22-35\% reduction in mean tree sizes for solved cases and a 3.6-5.6\% decrease in the remaining gap for unsolved ones. Our approach extends to reliability branching (RB), where improved scores reduce mean tree sizes by 5-13\% on solved instances and lower the mean gap by 2.6-4.3\% on unsolved instances, depending on primal bound quality.