Santanu S. Dey

From MaRDI portal
Person:378130

Available identifiers

zbMath Open dey.santanu-subhasMaRDI QIDQ378130

List of research outcomes

PublicationDate of PublicationType
A theoretical and computational analysis of full strong-branching2024-04-09Paper
Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity2024-01-17Paper
https://portal.mardi4nfdi.de/entity/Q61472842024-01-15Paper
Sensitivity analysis for mixed binary quadratic programming2023-12-10Paper
Branch-and-bound solves random binary IPs in poly\((n)\)-time2023-05-25Paper
Solving sparse principal component analysis with global support2023-05-02Paper
Node-based valid inequalities for the optimal transmission switching problem2023-03-29Paper
Strong mixed-integer formulations for the floor layout problem2023-03-15Paper
Beating the SDP bound for the floor layout problem: a simple combinatorial idea2023-03-15Paper
Lifting convex inequalities for bipartite bilinear programs2023-03-14Paper
Lower bounds on the size of general branch-and-bound trees2023-03-01Paper
Lower bound on size of branch-and-bound trees for solving lot-sizing problem2022-10-17Paper
Approximation Algorithms for Training One-Node ReLU Neural Networks2022-09-23Paper
A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid2022-09-19Paper
Exploiting Instance and Variable Similarity to Improve Learning-Enhanced Branching2022-08-21Paper
Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA2022-08-05Paper
Estimating parameters of mixtures of multivariate \(t\)-populations and application to classification of observations2022-08-04Paper
Solving sparse separable bilinear programs using lifted bilinear cover inequalities2022-07-30Paper
Rokhlin property for group actions on Hilbert \(C^*\)-modules2022-07-01Paper
Cutting Plane Generation through Sparse Principal Component Analysis2022-06-17Paper
Complexity of training ReLU neural network2022-06-09Paper
Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices2022-04-29Paper
On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations2022-04-29Paper
https://portal.mardi4nfdi.de/entity/Q50667352022-03-30Paper
Sparse PSD approximation of the PSD cone2022-03-22Paper
Node-based valid inequalities for the optimal transmission switching problem2021-12-25Paper
Lifting convex inequalities for bipartite bilinear programs2021-12-21Paper
Lower bound on size of branch-and-bound trees for solving lot-sizing problem2021-12-07Paper
Inference on parameters of Watson distributions and application to classification of observations2021-11-24Paper
Comparing geometric discord and negativity for bipartite states2021-10-12Paper
Lower Bounds on the Size of General Branch-and-Bound Trees2021-03-17Paper
Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming2021-03-11Paper
Optimization-Driven Scenario Grouping2021-01-07Paper
Using Submodularity within Column Generation to Solve the Flight-to-Gate Assignment Problem2020-11-11Paper
The Convex Hull of a Quadratic Constraint over a Polytope2020-11-09Paper
The order-\(n\) minors of certain \((n+k)\times n\) matrices2020-08-28Paper
Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem2020-05-04Paper
Subset Selection in Sparse Matrices2020-04-24Paper
A K-Nearest Neighbor Heuristic for Real-Time DC Optimal Transmission Switching2020-03-23Paper
Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs2020-03-11Paper
The strength of multi-row aggregation cuts for sign-pattern integer programs2020-02-10Paper
Decomposable Formulation of Transmission Constraints for Decentralized Power Systems Optimization2020-01-21Paper
New SOCP relaxation and branching rule for bipartite bilinear programs2019-10-29Paper
Bures distance and transition probability for \(\alpha\)-CPD-kernels2019-07-18Paper
Nonunique Lifting of Integer Variables in Minimal Inequalities2019-05-13Paper
Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem2019-05-03Paper
Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs2019-01-14Paper
An Approximation Algorithm for training One-Node ReLU Neural Network2018-10-08Paper
On a cardinality-constrained transportation problem with market choice2018-10-01Paper
Aggregation-based cutting-planes for packing and covering integer programs2018-09-28Paper
Incorporating views on marginal distributions in the calibration of risk models2018-09-28Paper
Some lower bounds on sparse outer approximations of polytopes2018-09-28Paper
Characteristic functions of liftings-II2018-07-18Paper
Theoretical challenges towards cutting-plane selection2018-07-13Paper
Some cut-generating functions for second-order conic sets2018-05-24Paper
Improving the Randomization Step in Feasibility Pump2018-02-14Paper
Sparse principal component analysis and its $l_1$-relaxation2017-12-03Paper
KSGNS construction for τ-maps on S-modules and ᵌ0-families2017-10-06Paper
\(\mathfrak{K}\)-families and CPD-H-extendable families2017-07-11Paper
Mixed-integer quadratic programming is in NP2017-03-23Paper
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions2017-03-23Paper
Relaxations and discretizations for the pooling problem2017-03-03Paper
On the Practical Strength of Two-Row Tableau Cuts2017-02-17Paper
Strong SOCP Relaxations for the Optimal Power Flow Problem2017-01-26Paper
Improving the Integer L-Shaped Method2016-11-01Paper
A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching2016-10-31Paper
Groves mechanisms and communication externalities2016-05-13Paper
Beating the SDP bound for the floor layout problem: A simple combinatorial idea2016-02-25Paper
Closedness of Integer Hulls of Simple Conic Sets2016-01-15Paper
Approximating polyhedra with sparse inequalities2015-12-09Paper
Strengthened bounds for the probability of \(k\)-out-of-\(n\) events2015-12-07Paper
Analysis of MILP Techniques for the Pooling Problem2015-11-20Paper
New Formulation and Strong MISOCP Relaxations for AC Optimal Transmission Switching Problem2015-10-07Paper
Generalized Repeated Interaction Model and Transfer Functions2015-09-07Paper
Functional models and minimal contractive liftings2015-06-18Paper
Forbidden Vertices2015-05-29Paper
Covering Linear Programming with Violations2015-01-27Paper
On the transportation problem with market choice2014-12-05Paper
Invariants for liftings of row contractions2014-10-15Paper
Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power Flow2014-10-03Paper
Design and verify: a new scheme for generating cutting-planes2014-06-27Paper
On the Chvátal-Gomory closure of a compact convex set2014-06-27Paper
Semi-continuous network flow problems2014-06-27Paper
How Good Are Sparse Cutting-Planes?2014-06-02Paper
Some properties of convex hulls of integer points contained in general convex sets2013-11-11Paper
Efficient Simulation of Large Deviation Events for Sums of Random Vectors Using Saddle-Point Representations2013-10-17Paper
Solving Mixed Integer Bilinear Problems Using MILP Formulations2013-09-25Paper
A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets2013-03-19Paper
A Strong Dual for Conic Mixed-Integer Programs2013-01-04Paper
Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra2012-10-15Paper
Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms2012-07-28Paper
Composite lifting of group inequalities and an application to two-row mixing inequalities2012-06-20Paper
The Chvátal-Gomory Closure of a Strictly Convex Body2012-05-24Paper
Split Rank of Triangle and Quadrilateral Inequalities2012-05-24Paper
On mixed-integer sets with two integer variables2012-04-05Paper
Standard commuting dilations and liftings2012-04-02Paper
A note on the split rank of intersection cuts2011-11-23Paper
On Maximal S-Free Convex Sets2011-10-27Paper
The split closure of a strictly convex body2011-08-09Paper
On the Chvátal-Gomory Closure of a Compact Convex Set2011-06-24Paper
Design and Verify: A New Scheme for Generating Cutting-Planes2011-06-24Paper
Characteristic Functions of Liftings2011-04-06Paper
Constrained Infinite Group Relaxations of MIPs2011-03-21Paper
LIFTINGS OF COVARIANT REPRESENTATIONS OF W*-CORRESPONDENCES2010-11-18Paper
Two row mixed-integer cuts via lifting2010-09-16Paper
The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron2010-06-22Paper
Experiments with Two Row Tableau Cuts2010-06-22Paper
The Group-Theoretic Approach in Mixed Integer Programming2010-06-03Paper
Relations between facets of low- and high-dimensional group problems2010-04-15Paper
On the extreme inequalities of infinite group problems2010-02-19Paper
Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles2008-06-10Paper
Facets of Two-Dimensional Infinite Group Problems2008-05-27Paper
Sequential-Merge Facets for Two-Dimensional Group Problems2007-11-29Paper
Characteristic functions for ergodic tuples2007-10-22Paper
Minimal Cuntz--Krieger dilations and representations of Cuntz--Krieger algebras2007-08-29Paper
Standard dilations of q-commuting tuples2007-01-10Paper
Standard noncommuting and commuting dilations of commuting tuples2004-01-07Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Santanu S. Dey