On the Matrix-Cut Rank of Polyhedra. - William J. Cook; Sanjeeb Dash (Math. Oper. Res., 2001)

An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs. - Sanjeeb Dash (IPCO, 2002)

Solution of a Min-Max Vehicle Routing Problem. - David L. Applegate; William J. Cook; Sanjeeb Dash; André Rohe (INFORMS J. Comput., 2002)

Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs. - Sanjeeb Dash (Math. Oper. Res., 2005)

Valid inequalities based on simple mixed-integer sets. - Sanjeeb Dash; Oktay Günlük (Math. Program., 2006)

Valid inequalities based on the interpolation procedure. - Sanjeeb Dash; Oktay Günlük (Math. Program., 2006)

JPEG compression history estimation for color images. - Ramesh Neelamani; Ricardo L. de Queiroz; Zhigang Fan 001; Sanjeeb Dash; Richard G. Baraniuk (IEEE Trans. Image Process., 2006)

On the MIR Closure of Polyhedra. - Sanjeeb Dash; Oktay Günlük; Andrea Lodi 001 (IPCO, 2007)

Production design for plate products in the steel industry. - Sanjeeb Dash; Jayant Kalagnanam; Chandra Reddy; Sang Hwa Song (IBM J. Res. Dev., 2007)

Exact solutions to linear programming problems. - David L. Applegate; William J. Cook; Sanjeeb Dash; Daniel G. Espinoza (Oper. Res. Lett., 2007)

On Nearly Orthogonal Lattice Bases and Random Lattices. - Ramesh Neelamani; Sanjeeb Dash; Richard G. Baraniuk (SIAM J. Discret. Math., 2007)

Projected Chvátal-Gomory cuts for mixed integer linear programs. - Pierre Bonami; Gérard Cornuéjols; Sanjeeb Dash; Matteo Fischetti; Andrea Lodi 001 (Math. Program., 2008)

On the strength of Gomory mixed-integer cuts as group cuts. - Sanjeeb Dash; Oktay Günlük (Math. Program., 2008)

Numerically Safe Gomory Mixed-Integer Cuts. - William J. Cook; Sanjeeb Dash; Ricardo Fukasawa; Marcos Goycoolea (INFORMS J. Comput., 2009)

On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs. - Sanjeeb Dash; Oktay Günlük (SIAM J. Optim., 2009)

A model for fusion and code motion in an automatic parallelizing compiler. - Uday Bondhugula; Oktay Günlük; Sanjeeb Dash; Lakshminarayanan Renganarayanan (PACT, 2010)

Two-Step MIR Inequalities for Mixed Integer Programs. - Sanjeeb Dash; Marcos Goycoolea; Oktay Günlük (INFORMS J. Comput., 2010)

On a generalization of the master cyclic group polyhedron. - Sanjeeb Dash; Ricardo Fukasawa; Oktay Günlük (Math. Program., 2010)

MIR closures of polyhedral sets. - Sanjeeb Dash; Oktay Günlük; Andrea Lodi 001 (Math. Program., 2010)

Erratum to: MIR closures of polyhedral sets. - Sanjeeb Dash; Oktay Günlük; Andrea Lodi 001 (Math. Program., 2010)

A heuristic to generate rank-1 GMI cuts. - Sanjeeb Dash; Marcos Goycoolea (Math. Program. Comput., 2010)

On the complexity of cutting-plane proofs using split cuts. - Sanjeeb Dash (Oper. Res. Lett., 2010)

On mixed-integer sets with two integer variables. - Sanjeeb Dash; Santanu S. Dey; Oktay Günlük (Oper. Res. Lett., 2011)

A note on the MIR closure and basic relaxations of polyhedra. - Sanjeeb Dash; Oktay Günlük; Christian Raack (Oper. Res. Lett., 2011)

Mixed Integer Rounding Cuts and Master Group Polyhedra. - Sanjeeb Dash (Combinatorial Optimization - Methods and Applications, 2011)

A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows. - Sanjeeb Dash; Oktay Günlük; Andrea Lodi 001; Andrea Tramontani (INFORMS J. Comput., 2012)

Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. - Sanjeeb Dash; Santanu S. Dey; Oktay Günlük (Math. Program., 2012)

The master equality polyhedron with multiple rows. - Sanjeeb Dash; Ricardo Fukasawa; Oktay Günlük (Math. Program., 2012)

On Some Generalizations of the Split Closure. - Sanjeeb Dash; Oktay Günlük; Diego Alejandro Morán Ramírez (IPCO, 2013)

A note on QUBO instances defined on Chimera graphs. - Sanjeeb Dash (CoRR, 2013)

On t-branch split cuts for mixed-integer programs. - Sanjeeb Dash; Oktay Günlük (Math. Program., 2013)

Screening for learning classification rules via Boolean compressed sensing. - Sanjeeb Dash; Dmitry M. Malioutov; Kush R. Varshney (ICASSP, 2014)

Computational Experiments with Cross and Crooked Cross Cuts. - Sanjeeb Dash; Oktay Günlük; Juan Pablo Vielma (INFORMS J. Comput., 2014)

Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming. - Sanjeeb Dash; Neil B. Dobbs; Oktay Günlük; Tomasz Nowicki; Grzegorz Swirszcz (Math. Program., 2014)

Learning interpretable classification rules using sequential rowsampling. - Sanjeeb Dash; Dmitry M. Malioutov; Kush R. Varshney (ICASSP, 2015)

On the relative strength of different generalizations of split cuts. - Sanjeeb Dash; Oktay Günlük; Marco Molinaro 001 (Discret. Optim., 2015)

On the polyhedrality of cross and quadrilateral closures. - Sanjeeb Dash; Oktay Günlük; Diego A. Morán R. (Math. Program., 2016)

The continuous knapsack set. - Sanjeeb Dash; Oktay Günlük; Laurence A. Wolsey (Math. Program., 2016)

Optimization over structured subsets of positive semidefinite matrices via column generation. - Amir Ali Ahmadi; Sanjeeb Dash; Georgina Hall (Discret. Optim., 2017)

A new lift-and-project operator. - Merve Bodur; Sanjeeb Dash; Oktay Günlük (Eur. J. Oper. Res., 2017)

Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse. - Merve Bodur; Sanjeeb Dash; Oktay Günlük; James R. Luedtke (INFORMS J. Comput., 2017)

Cutting planes from extended LP formulations. - Merve Bodur; Sanjeeb Dash; Oktay Günlük (Math. Program., 2017)

On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width. - Sanjeeb Dash; Oktay Günlük; Diego A. Morán R. (SIAM J. Optim., 2017)

Boolean Decision Rules via Column Generation. - Sanjeeb Dash; Oktay Günlük; Dennis Wei (NeurIPS, 2018)

Binary extended formulations of polyhedral mixed-integer sets. - Sanjeeb Dash; Oktay Günlük; Robert Hildebrand (Math. Program., 2018)

Generalized Linear Rule Models. - Dennis Wei; Sanjeeb Dash; Tian Gao; Oktay Günlük (ICML, 2019)

Cardinality Constrained Multilinear Sets. - Rui Chen; Sanjeeb Dash; Oktay Günlük (ISCO, 2020)

Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping. - Shashanka Ubaru; Sanjeeb Dash; Arya Mazumdar; Oktay Günlük (NeurIPS, 2020)

Symbolic Regression using Mixed-Integer Nonlinear Optimization. - Vernon Austel; Cristina Cornelio; Sanjeeb Dash; Joao Goncalves; Lior Horesh; Tyler R. Josephson; Nimrod Megiddo (CoRR, 2020)

Lattice closures of polyhedra. - Sanjeeb Dash; Oktay Günlük; Diego A. Morán R. (Math. Program., 2020)

Integer Programming for Causal Structure Learning in the Presence of Latent Variables. - Rui Chen; Sanjeeb Dash; Tian Gao (ICML, 2021)

Integration of Data and Theory for Accelerated Derivable Symbolic Discovery. - Cristina Cornelio; Sanjeeb Dash; Vernon Austel; Tyler R. Josephson; Joao Goncalves; Kenneth L. Clarkson; Nimrod Megiddo; Bachir El Khadir; Lior Horesh (CoRR, 2021)

LPRules: Rule Induction in Knowledge Graphs Using Linear Programming. - Sanjeeb Dash; Joao Goncalves (CoRR, 2021)

Generalized Chvátal-Gomory closures for integer programs with bounds on variables. - Sanjeeb Dash; Oktay Günlük; Dabeen Lee (Math. Program., 2021)

Bayesian Experimental Design for Symbolic Discovery. - Kenneth L. Clarkson; Cristina Cornelio; Sanjeeb Dash; Joao Goncalves; Lior Horesh; Nimrod Megiddo (CoRR, 2022)

On a generalization of the Chvátal-Gomory closure. - Sanjeeb Dash; Oktay Günlük; Dabeen Lee (Math. Program., 2022)

Rule Induction in Knowledge Graphs Using Linear Programming. - Sanjeeb Dash; Joao Goncalves (AAAI, 2023)

Heavy Sets with Applications to Interpretable Machine Learning Diagnostics. - Dmitry M. Malioutov; Sanjeeb Dash; Dennis Wei (AISTATS, 2023)

AI Hilbert: From Data and Background Knowledge to Automated Scientific Discovery. - Ryan Cory-Wright; Bachir El Khadir; Cristina Cornelio; Sanjeeb Dash; Lior Horesh (CoRR, 2023)

Obtaining Explainable Classification Models using Distributionally Robust Optimization. - Sanjeeb Dash; Soumyadip Ghosh; Joao Goncalves; Mark S. Squillante (CoRR, 2023)

Multilinear sets with two monomials and cardinality constraints. - Rui Chen; Sanjeeb Dash; Oktay Günlük (Discret. Appl. Math., 2023)

Interpretable and Fair Boolean Rule Sets via Column Generation. - Connor Lawless; Sanjeeb Dash; Oktay Günlük; Dennis Wei (J. Mach. Learn. Res., 2023)

Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions. - Rui Chen; Sanjeeb Dash; Oktay Günlük (Discret. Optim., 2023)

On polytopes with linear rank with respect to generalizations of the split closure. - Sanjeeb Dash; Yatharth Dubey (Discret. Optim., 2024)

Integer Programming Based Methods and Heuristics for Causal Graph Learning. - Sanjeeb Dash; Joao Goncalves; Tian Gao (AISTATS, 2025)