Sanjeeb Dash

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 34

Top Topics

Integer Program

Positive Semidefinite Matrices

Classification Rules

Cardinality Constraints

Top Venues

Discret. Optim.

INFORMS J. Comput.

Publications

Sanjeeb Dash, Yatharth Dubey
On polytopes with linear rank with respect to generalizations of the split closure. Discret. Optim. 51 (2024)
Rui Chen, Sanjeeb Dash, Oktay Günlük
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions. Discret. Optim. 50 (2023)
Connor Lawless, Sanjeeb Dash, Oktay Günlük, Dennis Wei
Interpretable and Fair Boolean Rule Sets via Column Generation. J. Mach. Learn. Res. 24 (2023)
Sanjeeb Dash, Soumyadip Ghosh, Joao Goncalves, Mark S. Squillante
Obtaining Explainable Classification Models using Distributionally Robust Optimization. CoRR (2023)
Rui Chen, Sanjeeb Dash, Oktay Günlük
Multilinear sets with two monomials and cardinality constraints. Discret. Appl. Math. 324 (2023)
Ryan Cory-Wright, Bachir El Khadir, Cristina Cornelio, Sanjeeb Dash, Lior Horesh
AI Hilbert: From Data and Background Knowledge to Automated Scientific Discovery. CoRR (2023)
Sanjeeb Dash, Joao Goncalves
Rule Induction in Knowledge Graphs Using Linear Programming. AAAI (2023)
Dmitry M. Malioutov, Sanjeeb Dash, Dennis Wei
Heavy Sets with Applications to Interpretable Machine Learning Diagnostics. AISTATS (2023)
Kenneth L. Clarkson, Cristina Cornelio, Sanjeeb Dash, Joao Goncalves, Lior Horesh, Nimrod Megiddo
Bayesian Experimental Design for Symbolic Discovery. CoRR (2022)
Sanjeeb Dash, Oktay Günlük, Dabeen Lee
On a generalization of the Chvátal-Gomory closure. Math. Program. 192 (1) (2022)
Sanjeeb Dash, Oktay Günlük, Dabeen Lee
Generalized Chvátal-Gomory closures for integer programs with bounds on variables. Math. Program. 190 (1) (2021)
Rui Chen, Sanjeeb Dash, Tian Gao
Integer Programming for Causal Structure Learning in the Presence of Latent Variables. ICML (2021)
Connor Lawless, Sanjeeb Dash, Oktay Günlük, Dennis Wei
Interpretable and Fair Boolean Rule Sets via Column Generation. CoRR (2021)
Cristina Cornelio, Sanjeeb Dash, Vernon Austel, Tyler R. Josephson, Joao Goncalves, Kenneth L. Clarkson, Nimrod Megiddo, Bachir El Khadir, Lior Horesh
Integration of Data and Theory for Accelerated Derivable Symbolic Discovery. CoRR (2021)
Rui Chen, Sanjeeb Dash, Tian Gao
Integer Programming for Causal Structure Learning in the Presence of Latent Variables. CoRR (2021)
Sanjeeb Dash, Joao Goncalves
LPRules: Rule Induction in Knowledge Graphs Using Linear Programming. CoRR (2021)
Sanjeeb Dash, Oktay Günlük, Dabeen Lee
On a Generalization of the Chvátal-Gomory Closure. IPCO (2020)
Sanjeeb Dash, Oktay Günlük, Diego A. Morán R.
Lattice closures of polyhedra. Math. Program. 181 (1) (2020)
Shashanka Ubaru, Sanjeeb Dash, Arya Mazumdar, Oktay Günlük
Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping. NeurIPS (2020)
Shashanka Ubaru, Sanjeeb Dash, Arya Mazumdar, Oktay Günlük
Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping. CoRR (2020)
Vernon Austel, Cristina Cornelio, Sanjeeb Dash, Joao Goncalves, Lior Horesh, Tyler R. Josephson, Nimrod Megiddo
Symbolic Regression using Mixed-Integer Nonlinear Optimization. CoRR (2020)
Rui Chen, Sanjeeb Dash, Oktay Günlük
Cardinality Constrained Multilinear Sets. ISCO (2020)
Dennis Wei, Sanjeeb Dash, Tian Gao, Oktay Günlük
Generalized Linear Rule Models. ICML (2019)
Dennis Wei, Sanjeeb Dash, Tian Gao, Oktay Günlük
Generalized Linear Rule Models. CoRR (2019)
Sanjeeb Dash, Oktay Günlük, Robert Hildebrand
Binary extended formulations of polyhedral mixed-integer sets. Math. Program. 170 (1) (2018)
Sanjeeb Dash, Oktay Günlük, Dennis Wei
Boolean Decision Rules via Column Generation. NeurIPS (2018)
Sanjeeb Dash, Oktay Günlük, Dennis Wei
Boolean Decision Rules via Column Generation. CoRR (2018)
Amir Ali Ahmadi, Sanjeeb Dash, Georgina Hall
Optimization over structured subsets of positive semidefinite matrices via column generation. Discret. Optim. 24 (2017)
Sanjeeb Dash, Oktay Günlük, Diego A. Morán R.
On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width. SIAM J. Optim. 27 (3) (2017)
Merve Bodur, Sanjeeb Dash, Oktay Günlük
Cutting planes from extended LP formulations. Math. Program. 161 (1-2) (2017)
Merve Bodur, Sanjeeb Dash, Oktay Günlük, James R. Luedtke
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse. INFORMS J. Comput. 29 (1) (2017)
Merve Bodur, Sanjeeb Dash, Oktay Günlük
A new lift-and-project operator. Eur. J. Oper. Res. 257 (2) (2017)
Sanjeeb Dash, Oktay Günlük, Laurence A. Wolsey
The continuous knapsack set. Math. Program. 155 (1-2) (2016)
Sanjeeb Dash, Oktay Günlük, Diego A. Morán R.
On the polyhedrality of cross and quadrilateral closures. Math. Program. 160 (1-2) (2016)
Sanjeeb Dash, Oktay Günlük, Marco Molinaro
On the relative strength of different generalizations of split cuts. Discret. Optim. 16 (2015)
Amir Ali Ahmadi, Sanjeeb Dash, Georgina Hall
Optimization over Structured Subsets of Positive Semidefinite Matrices via Column Generation. CoRR (2015)
Sanjeeb Dash, Dmitry M. Malioutov, Kush R. Varshney
Learning interpretable classification rules using sequential rowsampling. ICASSP (2015)
Sanjeeb Dash, Oktay Günlük, Juan Pablo Vielma
Computational Experiments with Cross and Crooked Cross Cuts. INFORMS J. Comput. 26 (4) (2014)
Sanjeeb Dash, Dmitry M. Malioutov, Kush R. Varshney
Screening for learning classification rules via Boolean compressed sensing. ICASSP (2014)
Sanjeeb Dash, Neil B. Dobbs, Oktay Günlük, Tomasz Nowicki, Grzegorz Swirszcz
Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming. Math. Program. 145 (1-2) (2014)
Sanjeeb Dash, Oktay Günlük
On t-branch split cuts for mixed-integer programs. Math. Program. 141 (1-2) (2013)
Sanjeeb Dash, Oktay Günlük, Diego Alejandro Morán Ramírez
On Some Generalizations of the Split Closure. IPCO (2013)
Sanjeeb Dash
A note on QUBO instances defined on Chimera graphs. CoRR (2013)
Sanjeeb Dash, Oktay Günlük, Andrea Lodi, Andrea Tramontani
A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows. INFORMS J. Comput. 24 (1) (2012)
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük
The master equality polyhedron with multiple rows. Math. Program. 132 (1-2) (2012)
Sanjeeb Dash, Santanu S. Dey, Oktay Günlük
Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. Math. Program. 135 (1-2) (2012)
Sanjeeb Dash, Oktay Günlük, Christian Raack
A note on the MIR closure and basic relaxations of polyhedra. Oper. Res. Lett. 39 (3) (2011)
Sanjeeb Dash, Santanu S. Dey, Oktay Günlük
On mixed-integer sets with two integer variables. Oper. Res. Lett. 39 (5) (2011)
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
MIR closures of polyhedral sets. Math. Program. 121 (1) (2010)
Sanjeeb Dash
On the complexity of cutting-plane proofs using split cuts. Oper. Res. Lett. 38 (2) (2010)
Uday Bondhugula, Oktay Günlük, Sanjeeb Dash, Lakshminarayanan Renganarayanan
A model for fusion and code motion in an automatic parallelizing compiler. PACT (2010)
Sanjeeb Dash, Marcos Goycoolea, Oktay Günlük
Two-Step MIR Inequalities for Mixed Integer Programs. INFORMS J. Comput. 22 (2) (2010)
Sanjeeb Dash, Marcos Goycoolea
A heuristic to generate rank-1 GMI cuts. Math. Program. Comput. 2 (3-4) (2010)
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük
On a generalization of the master cyclic group polyhedron. Math. Program. 125 (1) (2010)
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
Erratum to: MIR closures of polyhedral sets. Math. Program. 123 (2) (2010)
Sanjeeb Dash, Oktay Günlük
On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs. SIAM J. Optim. 20 (2) (2009)
William J. Cook, Sanjeeb Dash, Ricardo Fukasawa, Marcos Goycoolea
Numerically Safe Gomory Mixed-Integer Cuts. INFORMS J. Comput. 21 (4) (2009)
Sanjeeb Dash, Oktay Günlük
On the strength of Gomory mixed-integer cuts as group cuts. Math. Program. 115 (2) (2008)
Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi
Projected Chvátal-Gomory cuts for mixed integer linear programs. Math. Program. 113 (2) (2008)
Sanjeeb Dash
On the complexity of cutting plane proofs using split cuts. Electron. Colloquium Comput. Complex. 15 (084) (2008)
David L. Applegate, William J. Cook, Sanjeeb Dash, Daniel G. Espinoza
Exact solutions to linear programming problems. Oper. Res. Lett. 35 (6) (2007)
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük
On a Generalization of the Master Cyclic Group Polyhedron. IPCO (2007)
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
On the MIR Closure of Polyhedra. IPCO (2007)
Sanjeeb Dash, Jayant Kalagnanam, Chandra Reddy, Sang Hwa Song
Production design for plate products in the steel industry. IBM J. Res. Dev. 51 (3/4) (2007)
Ramesh Neelamani, Sanjeeb Dash, Richard G. Baraniuk
On Nearly Orthogonal Lattice Bases and Random Lattices. SIAM J. Discret. Math. 21 (1) (2007)
Ramesh Neelamani, Ricardo L. de Queiroz, Zhigang Fan, Sanjeeb Dash, Richard G. Baraniuk
JPEG compression history estimation for color images. IEEE Trans. Image Process. 15 (6) (2006)
Sanjeeb Dash, Oktay Günlük
Valid inequalities based on simple mixed-integer sets. Math. Program. 105 (1) (2006)
Sanjeeb Dash, Oktay Günlük
Valid inequalities based on the interpolation procedure. Math. Program. 106 (1) (2006)
Sanjeeb Dash
Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs. Math. Oper. Res. 30 (3) (2005)
Sanjeeb Dash, Oktay Günlük
Valid Inequalities Based on Simple Mixed-Integer Sets. IPCO (2004)
Sanjeeb Dash
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs. IPCO (2002)
David L. Applegate, William J. Cook, Sanjeeb Dash, André Rohe
Solution of a Min-Max Vehicle Routing Problem. INFORMS J. Comput. 14 (2) (2002)
William J. Cook, Sanjeeb Dash
On the Matrix-Cut Rank of Polyhedra. Math. Oper. Res. 26 (1) (2001)