santanu.dey@isye.gatech.edu

Office: Groseclose, Rm 443
765 Ferst Dr, Atlanta GA 30332

Phone:+1 (404) 385-7483
Fax:+1 (404) 894-2301

Alternatively sort by: [Type of Publication]
Selected bibliography: [Google Scholar][DBLP]

Power Systems Optimization

  1. Dahye Han, Nan Jiang, Santanu S. Dey, and Weijun Xie, "Regularized MIP Model for Optimal Power Flow with Energy Storage Systems and its Applications". [pdf]
  2. Alinson S. Xavier, Santanu S. Dey, Feng Qiu, "Decomposable Formulation of Transmission Constraints for Decentralized Power Systems Optimization," INFORMS Journal on Computing, 36, 1562–1578, 2024. [doi] [pdf]
  3. Emma S. Johnson, Santanu S. Dey, Jonathan Eckstein, Cynthia A. Phillips, John D. Siirola. "A Covering Decomposition Algorithm for Power Grid Cyber-Network Segmentation". [pdf]
  4. Emma S. Johnson, Santanu S. Dey, "A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid," INFORMS Journal on Computing, 34, 2296-2312, 2022. [doi] [pdf]
  5. Santanu S. Dey, Burak Kocuk, Nicole Redder, "Node-based valid inequalities for the optimal transmission switching problem," Discrete Optimization, 43, 100683, 2022. [doi] [pdf]
  6. Burak Kocuk, Santanu S. Dey, X. Andy Sun, "Matrix Minor Reformulation and SOCP-based Spatial Branch-and-Cut Method for the AC Optimal Power Flow Problem," Mathematical Programming C, 10, 557-596, 2018. [doi][pdf]
  7. Burak Kocuk, Santanu S. Dey, X. Andy Sun, "New Formulation and Strong MISOCP Relaxations for AC Optimal Transmission Switching Problem," IEEE Transactions on Power Systems, 32, 4161-4170, 2017. [doi] [pdf]
  8. Burak Kocuk, Hyemin Jeon, Santanu S. Dey, Jeff Linderoth, James Luedtke, X. Andy Sun, "A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching," Operations Research, 64, 922-938, 2016. [doi] [pdf] [instances]
  9. Burak Kocuk, Santanu S. Dey, X. Andy Sun, "Strong SOCP relaxations for the optimal power flow problem," Operations Research, 64, 1177-1196, 2016. [doi] [pdf] [slides]
  10. Burak Kocuk, Santanu S. Dey, X. Andy Sun, "Inexactness of SDP Relaxation for Optimal Power Flow over Radial Networks and Valid Inequalities for Global Optimization," IEEE Transactions on Power Systems, 31, 642-651, 2016. [doi] [pdf] [instances]

      11. Branch-and-Bound Algorithm

      1. Santanu S. Dey, Diego Morán, Jingye Xu, "Branching with a pre-specified finite list of k-sparse split sets for binary MILPs". [pdf]
      2. Prachi Shah, Santanu S. Dey, Marco Molinaro, "Non-Monotonicity of Branching Rules with respect to Linear Relaxations". [pdf]
      3. Santanu S. Dey, Prachi Shah, "Lower bound on size of branch-and-bound trees for solving lot-sizing problem,"Operations Research Letters, 50, 430-433, 2022. [doi] [pdf]
      4. Santanu S. Dey, Yatharth Dubey, Marco Molinaro, Prachi Shah, "A Theoretical and Computational Analysis of Full Strong-Branching," Mathematical Programming, 205, 303-336, 2024. [doi] [pdf]
      5. Santanu S. Dey, Yatharth Dubey, Marco Molinaro, "Branch-and-bound solves random binary IPs in poly(n)-time," Mathematical Programming, 200, 569-587, 2023. [doi][pdf]
        • [SODA version] Santanu S. Dey, Yatharth Dubey, Marco Molinaro, "Branch-and-Bound Solves Random Binary IPs in Polytime," Proceedings of SODA , 579–591, 2021. [doi] [pdf]
      6. Santanu S. Dey, Yatharth Dubey, Marco Molinaro, "Lower Bounds on the size of general branch-and-bound trees," Mathematical Programming, 198, 539-559, 2023. [doi] [pdf]

          7. Cutting Planes for Mixed Integer Linear Programming

          1. Berkay Becu, Santanu S. Dey, Feng Qiu, Alinson S. Xavier, "Approximating the Gomory Mixed-Integer Cut Closure Using Historical Data". [pdf]
          2. Amitabh Basu, Santanu S. Dey, Joseph Paat, "Nonunique Lifting of Integer Variables in Minimal Inequalities," SIAM Journal on Discrete Mathematics, 33, 755-783, 2019. [doi][pdf]
          3. Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco Molinaro, "Lower bounds on the lattice-free rank for packing and covering integer programs," SIAM Journal on Optimization, 29, 55-76, 2019. [doi] [pdf]
          4. Santanu S. Dey, Marco Molinaro,"Theoretical challenges towards cutting-plane selection," Mathematical Programming, 170, 237-266, 2018. [doi][pdf]
          5. Santanu S. Dey, Andres Iroume, Guanyi Wang, "The Strength of Multi-row Aggregation Cuts for Sign-pattern Integer Programs," Operations Research Letters, 46, 611-615, 2018. [doi][pdf]
          6. Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco Molinaro, Sebastian Pokutta, "Aggregation-based cutting-planes for packing and covering integer programs," Mathematical Programming, 171, 331-359, 2018. [doi] [pdf] [slides]
          7. Santanu S. Dey, Marco Molinaro, Qianyi Wang, "Analysis of Sparse Cutting-plane for Sparse IPs with Applications to Stochastic IPs," Mathematics of Operations Research, 43, 304-332, 2018. [doi] [pdf] [slides] [video]
          8. Santanu S. Dey, Andres Iroume, Marco Molinaro, "Some lower bounds on sparse outer approximations of polytopes," Operations Research Letters, 43, 323-328, 2015. [doi] [pdf]
          9. Santanu S. Dey, Marco Molinaro, Qianyi Wang, "Approximating Polyhedra with Sparse Inequalities," Mathematical Programming, 154, 329-352, 2015. [doi] [pdf] [slides]
            • [IPCO version] Santanu S. Dey, Marco Molinaro, Qianyi Wang, "How Good are Sparse Cutting-Planes?" 17th Conference on Integer Programming and Combinatorial Optimization , 261-272, 2014. [doi][pdf]
          10. Santanu S. Dey, Sebastian Pokutta, "Design and Verify: A New Scheme for Generating Cutting-Planes," Mathematical Programming A, 145, 199-222, 2014. [doi] [pdf] [slides]
            • [IPCO version] Santanu S. Dey, Sebastian Pokutta, “Design and Verify: A New Scheme for Generating Cutting-Planes,” Proceeding 15th Conference on Integer Programming and Combinatorial Optimization, 143 - 155, 2011. [doi] [pdf]
          11. Sanjeeb Dash, Santanu S. Dey, Oktay Günlük, “Two Dimensional Lattice-free Cuts and Asymmetric Disjunctions for Mixed-integer Polyhedra,” Mathematical Programming A, 135, 221-254, 2012. [doi] [pdf] [slides]
          12. Sanjeeb Dash, Santanu S. Dey, Oktay Günlük. “On Mixed-integer Sets with Two Integer Variables,” Operations Research Letters 39, 305-309, 2011. [doi] [pdf]
          13. Santanu S. Dey, Quentin Louveaux, “Split Rank of Triangle and Quadrilateral inequalities,” Mathematics of Operations Research, 36, 432-461, 2011. [doi] [pdf] [slides]
          14. Santanu S. Dey, “A Note on Split Rank of Intersection Cuts,” Mathematical Programming A, 130, 107- 124, 2011. [doi] [pdf] [slides]
          15. Santanu S. Dey, Laurence A. Wolsey, “Constrained Infinite Group Relaxation of MIPs,” SIAM Journal on Optimization, 20, 2890-2912, 2010. [doi] [pdf] [slides]
          16. Santanu S. Dey, Laurence A. Wolsey, “Composite Lifting of Group Inequalities and an Application to Two-Row Mixing Inequalities,” Discrete Optimization, 7, 256-268, 2010. [doi] [pdf] [slides]
          17. Santanu S. Dey, Laurence A. Wolsey, “Two Row Mixed Integer Cuts Via Lifting,” Mathematical Programming B, 124, 143-174, 2010. [doi] [pdf] [slides]
            • [IPCO version] Santanu S. Dey, Laurence A. Wolsey, “Lifting integer variables in minimal inequalities corresponding to lattice-free triangles,” Proceeding 13th Conference on Integer Programming and Combinatorial Optimization, 463- 475, 2008. [doi]
          18. Santanu S. Dey, Jean-Philippe P. Richard, “Relations between facets of low- and high-dimensional group problems,” Mathematical Programming A, 123, 285-313, 2010. [doi] [pdf] [slides]
            • [IPCO version] Santanu S. Dey, Jean-Philippe P. Richard, “Sequential-Merge facets for two-dimensional group problems,” Proceeding 12th Conference on Integer Programming and Combinatorial Optimization, 30- 42, 2007. [doi]
          19. Santanu S. Dey, Jean-Philippe P. Richard, Yanjun Li, Lisa A. Miller, “On Extreme Inequalities for Infinite Group Problems,” Mathematical Programming A, 121, 145- 170, 2010. [doi] [pdf] [slides]
          20. Santanu S. Dey, Andrea Lodi, Laurence A. Wolsey, Andrea Tramontani, “On the Practical Strength of Two-Row Tableau Cuts,” INFORMS Journal on Computing , 26, 222-237, 2014. [doi] [pdf]
            • [IPCO version] Santanu S. Dey, Andrea Lodi, Laurence A. Wolsey, Andrea Tramontani, “Experiments with Two Row Tableau Cuts,” Proceeding 14th Conference on Integer Programming and Combinatorial Optimization, 424-437, 2010. [doi]
          21. Santanu S. Dey, Jean-Philippe P. Richard, “Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms,” INFORMS Journal on Computing, 21, 137- 150, 2009. [doi] [pdf] [slides]
          22. [Review article] Santanu S. Dey, Andrea Tramontani, “Recent Developments in Multiple Row Cuts,” Optima - Mathematical Programming Society Newsletter, 80, 2-8 September 2009. Click here for the Optima Issue.
          23. [Book chapter] Jean-Philippe P. Richard, Santanu S. Dey, “The Group-Theoretic Approach in Mixed Integer Programming: Theory, Computation and Perspectives,” Fifty years of Integer Programming 1958-2008: From early years to the state-of-the-art (M. Juenger, T. Liebling, D. Naddef, G. Nemhauser, W. Pulleyblank, G. Reinelt, G. Rinaldi, and L. Wolsey (eds.)), December 2009 (Springer). [doi]
          24. Santanu S. Dey, Jean-Philippe P. Richard, “Facets of Two-Dimensional Infinite Group Problems,” Mathematics of Operations Research, 33, 140-166, 2008. [doi] [pdf] [slides]

              25. Mixed Integer Non-linear Programming

              1. Yongchun Li, Santanu S. Dey, Weijun Xie, "On Sparse Canonical Correlation Analysis" NeurIPS 2024. [pdf]
              2. Sourabh Choudhary, Santanu S. Dey, Nikolaos V. Sahinidis, "Water network design and operation optimization: Leveraging linear approximations for solving challenging MINLPs". [pdf]
              3. Yijiang Li, Santanu S. Dey, Nikolaos V. Sahinidis, Naresh Susarla, Miguel A. Zamarripa, Markus G. Drouven, "Optimizing the design and operation of water networks: Two decomposition approaches," Computers and Chemical Engineering, 192, 108897, 2025. [doi] [pdf]
              4. Yijiang Li, Santanu S. Dey, Nikolaos V. Sahinidis, "A reformulation-enumeration MINLP algorithm for gas network design," Journal of Global Optimization, 90, 931-963, 2024. [doi] [pdf]
              5. Diego Cifuentes, Santanu S. Dey, Jingye Xu, "Sensitivity analysis for mixed binary quadratic programming". [pdf]
              6. Santanu S. Dey, Marco Molinaro, Guanyi Wang "Solving sparse principal component analysis with global support," Mathematical Programming 199, 421-459, 2023. [doi] [pdf]
                • [ICML version] Santanu S. Dey, Guanyi Wang, “Upper bounds for Model-Free Row-Sparse Principal Component Analysis," Proceedings of ICML 2020 . [link]
              7. Xiaoyi Gu, Shabbir Ahmed, Santanu S. Dey, "Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming," SIAM Journal on Optimization, 30, 781-797, 2020. [doi] [pdf]
              8. Santanu S. Dey, Guanyi Wang, Yao Xie, "An Approximation Algorithm for Training One-Node ReLU Neural Network," IEEE Transactions on Signal Processing, 68, 6696-6706, 2020. [doi] [pdf]
              9. Santanu S. Dey, Rahul Mazumder, Guanyi Wang, "Using l1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA," Operations Research, 70, 1914-1932, 2021. [doi] [pdf] [data] [slides]
              10. Alberto Del Pia, Santanu S. Dey, Robert Weismantel, "Subset selection in sparse matrices," SIAM Journal on Optimization, 30, 1173-1190, 2020. [doi] [pdf] [slides]
              11. Digvijay Boob, Santanu S. Dey, Guanghui Lan, "Complexity of Training ReLU Neural Network," Discrete Optimization, 44, 100620, 2022. [doi][pdf]
              12. Asteroide Santana, Santanu S. Dey, "Some cut-generating functions for second-order conic sets," Discrete Optimization, 24, 51-65, 2017. [doi] [pdf] [slides]
              13. Burak Kocuk, Santanu S. Dey, X. Andy Sun, "New Formulation and Strong MISOCP Relaxations for AC Optimal Transmission Switching Problem," IEEE Transactions on Power Systems, 32, 4161-4170, 2017. [doi] [pdf]
              14. Alberto Del Pia, Santanu S. Dey, Marco Molinaro, "Mixed-integer Quadratic Programming is in NP," Mathematical Programming, 162, 225-240, 2017. [doi] [pdf] [slides]
              15. Diego A. Morán R., Santanu S. Dey, "Closedness of Integer Hulls of Simple Conic Sets," SIAM Journal on Discrete Mathematics, 30, 70-99, 2016. [doi] [pdf]
                • [IPCO version] Diego A. Morán R., Santanu S. Dey, "A Polynomial-time Algorithm to Check Closedness of Simple Second Order Mixed-integer Sets," Proceeding 16th Conference on Integer Programming and Combinatorial Optimization ,266-277 ,2013. [doi]
              16. Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma, "On the Chvátal-Gomory Closure of a Compact Convex Set," Mathematical Programming A, 145, 327-348, 2014. [doi] [pdf]
                • [IPCO version] Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma, “On the Chvátal-Gomory Closure of a Compact Convex Set,” Proceeding 15th Conference on Integer Programming and Combinatorial Optimization, 2011. [doi]
              17. Santanu S. Dey, Diego A. Morán R., "Some Properties of Convex Hulls of Integer Points Contained in General Convex Sets," Mathematical Programming A, 141, 507-526, 2013. [doi] [pdf] [slides]
              18. Diego A. Morán R., Santanu S. Dey, Juan Pablo Vielma, "A Strong Dual for Conic Mixed-Integer Programs," SIAM Journal on Optimization, 22, 1136-1150, 2012. [doi] [pdf] [slides]
              19. Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma, “The Chvátal-Gomory Closure of a Strictly Convex Body,” Mathematics of Operations Research, 36, 227-239, 2011. [doi] [pdf] [slides]
                • [IPCO version] Santanu S. Dey, Juan Pablo Vielma, “The Chvátal-Gomory Closure of an Ellipsoid is a Polyhedron,” Proceeding 14th Conference on Integer Programming and Combinatorial Optimization, 327- 340, 2010. [doi]
              20. Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma, “The Split Closure of a Strictly Convex Body,” Operations Research Letters, 39, 121- 126, 2011. [doi] [pdf]
              21. Diego A. Morán R., Santanu S. Dey, “On Maximal S-free Convex Sets,” SIAM Journal on Discrete Mathematics, 25, 379-393, 2011. [doi] [pdf]

              0/1 IPs and Related Problems

              1. Diego Cifuentes, Santanu S. Dey, Jingye Xu, "Lagrangian dual with zero duality gap that admits decomposition". [pdf]
              2. Emma S. Johnson, Shabbir Ahmed, Santanu S. Dey, Jean-Paul Watson, "A k-nearest neighbor heuristic for real-time DC optimal transmission switching". [pdf]
              3. Santanu S. Dey, Burak Kocuk, Nicole Redder, "Node-based valid inequalities for the optimal transmission switching problem," Discrete Optimization, 43, 100683, 2022. [doi] [pdf]
              4. Yijiang Li, John-Paul Clarke, Santanu S. Dey, "Using Submodularity within Column Generation to Solve the Flight-to-Gate Assignment Problem," Transportation Research Part C, 129, 103217, 2021. [doi] [pdf]
              5. Alinson S. Xavier, Santanu S. Dey, Feng Qiu, "Decomposable Formulation of Transmission Constraints for Decentralized Power Systems Optimization," INFORMS Journal on Computing, 36, 1562–1578, 2024. [doi] [pdf]
              6. Santanu S. Dey, Andres Iroume, Marco Molinaro, Domenico Salvagnin, "Improving the Randomization Step in Feasibility Pump," SIAM Journal on Optimization, 28, 355-378, 2018. [doi] [pdf] [slides] [instances]
              7. Joey Huchette, Santanu S. Dey, Juan Pablo Vielma, "Beating the SDP bound for the floor layout problem: A simple combinatorial idea," INFOR: Information Systems and Operational Research, 56, 457-481, 2018. [doi] [pdf]
              8. Joey Huchette, Santanu S. Dey, Juan Pablo Vielma, "Strong mixed-integer formulations for the floor layout problem," INFOR: Information Systems and Operational Research, 56, 392-433, 2018. [doi] [pdf]
              9. Burak Kocuk, Hyemin Jeon, Santanu S. Dey, Jeff Linderoth, James Luedtke, X. Andy Sun, "A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching," Operations Research, 64, 922-938, 2016. [doi] [pdf] [instances]
              10. Pelin Damci-Kurt, Santanu S. Dey, Simge Kucukyavuz, "On the Transportation Problem with Market Choice," Discrete Applied Mathematics, 181, 54-77, 2015. [doi] [pdf]
              11. Gustavo Angulo, Shabbir Ahmed, Santanu S. Dey, "Improving the integer L-shaped method," INFORMS Journal on Computing, 28, 483-499, 2016. [doi] [pdf]
              12. Gustavo Angulo, Shabbir Ahmed, Santanu S. Dey, Volker Kaibel, "Forbidden Vertices," Mathematics of Operations Research, 40, 350-360, 2015. [doi] [pdf]
              13. Gustavo Angulo, Shabbir Ahmed, Santanu S. Dey, "Semi-continuous network flow problems," Mathematical Programming A, 145, 565-599, 2014. [doi] [pdf]

              Quadratically Constrained Quadratic Programs

              1. Santanu S. Dey, Dahye Han, Yang Wang, "Aggregation of Bilinear Bipartite Equality Constraints and its Application to Structural Model Updating Problem". [pdf]
              2. Grigoriy Blekherman, Santanu S. Dey, Shengding Sun, "Aggregation of quadratic inequalities and hidden hyperplane convexity," SIAM Journal on Optimization, 34, 98-126, 2024. [doi] [pdf]
              3. Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard, "Solving sparse separable bilinear programs using lifted bilinear cover inequalities," INFORMS Journal on Computing, 36, 884-899, 2024. [doi] [pdf]
              4. Santanu S. Dey, Gonzalo Munoz, Felipe Serrano, "On obtaining the convex hull of quadratic inequalities via aggregations" SIAM Journal on Optimization, 32, 659-686, 2022. [doi] [pdf]
              5. Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard, "Lifting convex inequalities for bipartite bilinear programs," Mathematical Programming, 197, 587–619, 2023. [doi][pdf]
                • [IPCO version] Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard, "Lifting convex inequalities for bipartite bilinear programs". Proceeding 22th Conference on Integer Programming and Combinatorial Optimization , 148-162, 2021. [doi]
              6. Santanu S. Dey, Aleksandr M. Kazachkov, Andrea Lodi, Gonzalo Munoz, "Cutting Plane Generation Through Sparse Principal Component Analysis," SIAM Journal on Optimization, 32, 1319-1343, 2022. [doi] [pdf]
              7. Grigoriy Blekherman, Santanu S. Dey, Kevin Shu, Shengding Sun, "Hyperbolic relaxation of k-Locally positive semidefinite matrices," SIAM Journal on Optimization, 32, 470-490, 2022. [doi] [pdf]
              8. Grigoriy Blekherman, Santanu S. Dey, Marco Molinaro, Shengding Sun, "Sparse PSD approximation of the PSD cone," Mathematical Programming, 191, 981-1004, 2022. [doi] [pdf] [slides] [video]
              9. Asteroide Santana, Santanu S. Dey, "The convex hull of a quadratic constraint over a polytope," SIAM Journal on Optimization, 30, 2983–2997, 2020. [doi] [pdf]
              10. Santanu S. Dey, Burak Kocuk, Asteroide Santana, "Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem," Journal of Global Optimization, 77, 227-272, 2020. [doi] [pdf] [data]
              11. Yu Otsuki, Dan Li, Santanu S. Dey, Masahiro Kurata, Yang Wang, "Finite Element Model Updating of an 18-Story Structure using Branch-and-Bound Algorithm with Epsilon-Constraint," Journal of Civil Structural Health Monitoring, 11, 575-592, 2021. [doi] [pdf]
              12. Asteroide Santana, Santanu S. Dey, "The convex hull of a quadratic constraint over a polytope," Accepted for publication in SIAM Journal on Optimization. [pdf]
              13. Santanu S. Dey, Asteroide Santana, Yang Wang, "New SOCP relaxation and branching rule for bipartite bilinear programs," Optimization and Engineering, 20, 307-336, 2019. [doi][pdf] [slides] [instances]
              14. Burak Kocuk, Santanu S. Dey, X. Andy Sun, "Matrix Minor Reformulation and SOCP-based Spatial Branch-and-Cut Method for the AC Optimal Power Flow Problem," Mathematical Programming C, 10, 557-596, 2018. [doi][pdf]
              15. Natashia Boland, Santanu S. Dey, Thomas Kalinowski, Marco Molinaro, Fabian Rigterink, "Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions," Mathematical Programming, 162, 523-535, 2017. [doi] [pdf]
              16. Burak Kocuk, Santanu S. Dey, X. Andy Sun, "Strong SOCP relaxations for the optimal power flow problem," Operations Research, 64, 1177-1196, 2016. [doi] [pdf] [slides]
              17. Burak Kocuk, Santanu S. Dey, X. Andy Sun, "Inexactness of SDP Relaxation for Optimal Power Flow over Radial Networks and Valid Inequalities for Global Optimization," IEEE Transactions on Power Systems, 31, 642-651, 2016. [doi] [pdf] [instances]
              18. Santanu S. Dey, Akshay Gupte, "Analysis Of MILP Techniques For The Pooling Problem" Operations Research, 63, 412-427, 2015. [doi] [pdf] [slides][video][instances]
              19. Akshay Gupte, Shabbir Ahmed, Myun Seok Cheon, Santanu S. Dey, "Solving Mixed Integer Bilinear Problems using MIP Formulations," SIAM Journal on Optimization, 23, 721-744, 2013. [doi] [pdf]
              20. Akshay Gupte, Shabbir Ahmed, Myun Seok Cheon, Santanu S. Dey, "Relaxations and discretizations for the pooling problem," Journal of Global Optimization, 67, 631-669, 2017. [doi] [pdf]

              Cardinality Constrained Mixed Integer Programs

              1. Guanyi Wang, Santanu S. Dey, "Upper bounds for Model-Free Row-Sparse Principal Component Analysis,"Proceedings of ICML 2020 . [link]
              2. Matthias Walter, Pelin Damci-Kurt, Santanu S. Dey, Simge Kucukyavuz, "On a Cardinality-Constrained Transportation Problem With Market Choice," Operations Research Letters, 44, 170-173, 2016. [doi] [pdf]
              3. Feng Qiu, Shabbir Ahmed, Santanu S. Dey, Laurence A. Wolsey, "Covering Linear Programming with Violations," INFORMS Journal on Computing, 26, 531-546, 2014. [doi][pdf]

              Stochastic Programming

              1. Dahye Han, Nan Jiang, Santanu S. Dey, and Weijun Xie, "Regularized MIP Model for Optimal Power Flow with Energy Storage Systems and its Applications". [pdf]
              2. Kevin Ryan, Shabbir Ahmed, Santanu S. Dey, Deepak Rajan, Amelia Musselman, Jean-Paul Watson, "Optimization Driven Scenario Grouping," INFORMS journal on Computing, 32, 805-821, 2020. [doi] [pdf]
              3. Santanu S. Dey, Marco Molinaro, Qianyi Wang, "Analysis of Sparse Cutting-plane for Sparse IPs with Applications to Stochastic IPs". [pdf] [slides] [video]
              4. Feng Qiu, Shabbir Ahmed, Santanu S. Dey, "Strengthened Bounds for the Probability of k-Out-Of-n Events," Discrete Applied Mathematics, 198, 232-240, 2016. [doi] [pdf]
              5. Gustavo Angulo, Shabbir Ahmed, Santanu S. Dey, "Improving the integer L-shaped method," INFORMS Journal on Computing, 28, 483-499, 2016. [pdf]
              6. Feng Qiu, Shabbir Ahmed, Santanu S. Dey, Laurence A. Wolsey, "Covering Linear Programming with Violations," INFORMS Journal on Computing, 26, 531-546, 2014. [doi][pdf]

              Bilevel Programming

              1. Dahye Han, Nan Jiang, Santanu S. Dey, and Weijun Xie, "Regularized MIP Model for Optimal Power Flow with Energy Storage Systems and its Applications". [pdf]
              2. Emma S. Johnson, Santanu S. Dey, Jonathan Eckstein, Cynthia A. Phillips, John D. Siirola. "A Covering Decomposition Algorithm for Power Grid Cyber-Network Segmentation". [pdf]
              3. Emma S. Johnson, Santanu S. Dey, "A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid," INFORMS Journal on Computing, 34, 2296-2312, 2022. [doi] [pdf]

              Other

              1. Efthymios Athanasiou, Santanu S. Dey, Giacomo Valletta, "Groves mechanisms and communication externalities," Review of Economic Design, 20, 1-37, 2016. [doi] [pdf]