pith. sign in

Santanu S. Dey

Identifiers

  • name variant Santanu S. Dey 0.60 · backfill

Papers (31)

  1. Copositive Matrices with Ordered Off-Diagonal Entries math.OC · 2026 · author #2
  2. Probabilistic analysis of dual decomposition on two-stage stochastic integer programs math.OC · 2026 · author #1
  3. Accelerating Column Generation in Highly Degenerate Integer Programming Problems with Template Pricing math.OC · 2026 · author #3
  4. A second-order cone representable class of nonconvex quadratic programs math.OC · 2025 · author #1
  5. Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming math.OC · 2019 · author #3
  6. The convex hull of a quadratic constraint over a polytope math.OC · 2018 · author #2
  7. An Approximation Algorithm for training One-Node ReLU Neural Network math.OC · 2018 · author #1
  8. Theoretical challenges towards cutting-plane selection math.OC · 2018 · author #1
  9. New SOCP relaxation and branching rule for bipartite bilinear programs math.OC · 2018 · author #1
  10. Sparse principal component analysis and its $l_1$-relaxation math.OC · 2017 · author #1
  11. The Strength of Multi-row Aggregation Cuts for Sign-pattern Integer Programs math.OC · 2017 · author #1
  12. Lower bounds on the lattice-free rank for packing and covering integer programs math.OC · 2017 · author #3
  13. Matrix Minor Reformulation and SOCP-based Spatial Branch-and-Cut Method for the AC Optimal Power Flow Problem math.OC · 2017 · author #2
  14. Improving the Randomization Step in Feasibility Pump math.OC · 2016 · author #1
  15. Aggregation-based cutting-planes for packing and covering integer programs math.OC · 2016 · author #3
  16. Some cut-generating functions for second-order conic sets math.OC · 2016 · author #2
  17. Non-unique lifting of integer variables in minimal inequalities math.OC · 2016 · author #2
  18. Beating the SDP bound for the floor layout problem: A simple combinatorial idea math.OC · 2016 · author #2
  19. Strong mixed-integer formulations for the floor layout problem math.OC · 2016 · author #2
  20. Analysis of Sparse Cutting-planes for Sparse MILPs with Applications to Stochastic MILPs math.OC · 2016 · author #1
  21. New Formulation and Strong MISOCP Relaxations for AC Optimal Transmission Switching Problem math.OC · 2015 · author #2
  22. Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions math.OC · 2015 · author #2
  23. Strong SOCP Relaxations for the Optimal Power Flow Problem math.OC · 2015 · author #2
  24. On a Cardinality-Constrained Transportation Problem With Market Choice math.OC · 2014 · author #2
  25. A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching math.OC · 2014 · author #3
  26. Some lower bounds on sparse outer approximations of polytopes math.OC · 2014 · author #1
  27. Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power Flow math.OC · 2014 · author #2
  28. Mixed-integer Quadratic Programming is in NP cs.DM · 2014 · author #2
  29. How Good Are Sparse Cutting-Planes? math.OC · 2014 · author #1
  30. Forbidden vertices math.OC · 2013 · author #3
  31. On the Chvatal-Gomory Closure of a Compact Convex Set math.OC · 2010 · author #2

Mentions

  • 1510.02064 #2 · backfill · confidence 0.70 Santanu S. Dey
  • 1507.08703 #2 · backfill · confidence 0.70 Santanu S. Dey
  • 1504.06770 #2 · backfill · confidence 0.70 Santanu S. Dey
  • 1412.8723 #2 · backfill · confidence 0.70 Santanu S. Dey
  • 1412.6245 #3 · backfill · confidence 0.70 Santanu S. Dey
  • 1412.3765 #1 · backfill · confidence 0.70 Santanu S. Dey
  • 1410.1004 #2 · backfill · confidence 0.70 Santanu S. Dey
  • 1407.4798 #2 · backfill · confidence 0.70 Santanu S. Dey
  • 1405.1789 #1 · backfill · confidence 0.70 Santanu S. Dey
  • 1309.2545 #3 · backfill · confidence 0.70 Santanu S. Dey
  • 2605.15970 #2 · arxiv_oai · confidence 0.70 Santanu S. Dey
  • 1011.1710 #2 · backfill · confidence 0.70 Santanu S. Dey

Frequent Coauthors