# Sanjeeb Dash

Orcid: 0000-0002-5837-0288
According to our database

Collaborative distances:

^{1}, Sanjeeb Dash authored at least 64 papers between 2001 and 2024.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2024

On polytopes with linear rank with respect to generalizations of the split closure.

Discret. Optim., 2024

2023

Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions.

Discret. Optim., November, 2023

J. Mach. Learn. Res., 2023

Discret. Appl. Math., 2023

Obtaining Explainable Classification Models using Distributionally Robust Optimization.

CoRR, 2023

CoRR, 2023

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Math. Program., 2022

CoRR, 2022

2021

Generalized Chvátal-Gomory closures for integer programs with bounds on variables.

Math. Program., 2021

CoRR, 2021

CoRR, 2021

Integer Programming for Causal Structure Learning in the Presence of Latent Variables.

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Math. Program., 2020

CoRR, 2020

Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping.

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019

Proceedings of the 36th International Conference on Machine Learning, 2019

2018

Math. Program., 2018

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017

On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width.

SIAM J. Optim., 2017

Math. Program., 2017

Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse.

INFORMS J. Comput., 2017

Eur. J. Oper. Res., 2017

Optimization over structured subsets of positive semidefinite matrices via column generation.

Discret. Optim., 2017

2016

Math. Program., 2016

Math. Program., 2016

2015

Discret. Optim., 2015

Proceedings of the 2015 IEEE International Conference on Acoustics, 2015

2014

Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming.

Math. Program., 2014

INFORMS J. Comput., 2014

Proceedings of the IEEE International Conference on Acoustics, 2014

2013

Math. Program., 2013

CoRR, 2013

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012

Math. Program., 2012

Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra.

Math. Program., 2012

INFORMS J. Comput., 2012

2011

Proceedings of the Combinatorial Optimization - Methods and Applications, 2011

Oper. Res. Lett., 2011

Oper. Res. Lett., 2011

2010

Oper. Res. Lett., 2010

Math. Program. Comput., 2010

Math. Program., 2010

Math. Program., 2010

Math. Program., 2010

INFORMS J. Comput., 2010

Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques, 2010

2009

SIAM J. Optim., 2009

INFORMS J. Comput., 2009

2008

Math. Program., 2008

Math. Program., 2008

2007

SIAM J. Discret. Math., 2007

Oper. Res. Lett., 2007

IBM J. Res. Dev., 2007

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

IEEE Trans. Image Process., 2006

Math. Program., 2006

Math. Program., 2006

2005

Math. Oper. Res., 2005

2002

INFORMS J. Comput., 2002

An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs.

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001

Math. Oper. Res., 2001