default search action
Sanjeeb Dash
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j43]Sanjeeb Dash, Yatharth Dubey
:
On polytopes with linear rank with respect to generalizations of the split closure. Discret. Optim. 51: 100821 (2024) - 2023
- [j42]Rui Chen
Multilinear sets with two monomials and cardinality constraints. Discret. Appl. Math. 324: 67-79 (2023) - [j41]Rui Chen
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions. Discret. Optim. 50: 100804 (2023) - [j40]Connor Lawless, Sanjeeb Dash, Oktay Günlük, Dennis Wei:
Interpretable and Fair Boolean Rule Sets via Column Generation. J. Mach. Learn. Res. 24: 229:1-229:50 (2023) - [c16]Sanjeeb Dash, Joao Goncalves:
Rule Induction in Knowledge Graphs Using Linear Programming. AAAI 2023: 4233-4241 - [c15]Dmitry M. Malioutov, Sanjeeb Dash, Dennis Wei:
Heavy Sets with Applications to Interpretable Machine Learning Diagnostics. AISTATS 2023: 5918-5930 - [i14]Ryan Cory-Wright, Bachir El Khadir, Cristina Cornelio, Sanjeeb Dash, Lior Horesh:
AI Hilbert: From Data and Background Knowledge to Automated Scientific Discovery. CoRR abs/2308.09474 (2023) - [i13]Sanjeeb Dash, Soumyadip Ghosh, Joao Goncalves, Mark S. Squillante:
Obtaining Explainable Classification Models using Distributionally Robust Optimization. CoRR abs/2311.01994 (2023) - 2022
- [j39]Sanjeeb Dash, Oktay Günlük, Dabeen Lee
On a generalization of the Chvátal-Gomory closure. Math. Program. 192(1): 149-175 (2022) - [i12]Kenneth L. Clarkson, Cristina Cornelio, Sanjeeb Dash, Joao Goncalves, Lior Horesh, Nimrod Megiddo:
Bayesian Experimental Design for Symbolic Discovery. CoRR abs/2211.15860 (2022) - 2021
- [j38]Sanjeeb Dash, Oktay Günlük, Dabeen Lee
Generalized Chvátal-Gomory closures for integer programs with bounds on variables. Math. Program. 190(1): 393-425 (2021) - [c14]Rui Chen, Sanjeeb Dash, Tian Gao:
Integer Programming for Causal Structure Learning in the Presence of Latent Variables. ICML 2021: 1550-1560 - [i11]Rui Chen, Sanjeeb Dash, Tian Gao:
Integer Programming for Causal Structure Learning in the Presence of Latent Variables. CoRR abs/2102.03129 (2021) - [i10]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 abs/2109.01634 (2021) - [i9]Sanjeeb Dash, Joao Goncalves:
LPRules: Rule Induction in Knowledge Graphs Using Linear Programming. CoRR abs/2110.08245 (2021) - [i8]Connor Lawless, Sanjeeb Dash, Oktay Günlük, Dennis Wei:
Interpretable and Fair Boolean Rule Sets via Column Generation. CoRR abs/2111.08466 (2021) - 2020
- [j37]Sanjeeb Dash
Lattice closures of polyhedra. Math. Program. 181(1): 119-147 (2020) - [c13]Sanjeeb Dash, Oktay Günlük, Dabeen Lee:
On a Generalization of the Chvátal-Gomory Closure. IPCO 2020: 117-129 - [c12]Rui Chen
Cardinality Constrained Multilinear Sets. ISCO 2020: 54-65 - [c11]Shashanka Ubaru, Sanjeeb Dash, Arya Mazumdar, Oktay Günlük:
Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping. NeurIPS 2020 - [i7]Vernon Austel, Cristina Cornelio, Sanjeeb Dash, Joao Goncalves, Lior Horesh, Tyler R. Josephson, Nimrod Megiddo:
Symbolic Regression using Mixed-Integer Nonlinear Optimization. CoRR abs/2006.06813 (2020) - [i6]Shashanka Ubaru, Sanjeeb Dash, Arya Mazumdar, Oktay Günlük:
Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping. CoRR abs/2006.14084 (2020)
2010 – 2019
- 2019
- [c10]Dennis Wei, Sanjeeb Dash, Tian Gao, Oktay Günlük
Generalized Linear Rule Models. ICML 2019: 6687-6696 - [i5]Dennis Wei, Sanjeeb Dash, Tian Gao, Oktay Günlük:
Generalized Linear Rule Models. CoRR abs/1906.01761 (2019) - 2018
- [j36]Sanjeeb Dash, Oktay Günlük
Binary extended formulations of polyhedral mixed-integer sets. Math. Program. 170(1): 207-236 (2018) - [c9]Sanjeeb Dash, Oktay Günlük
Boolean Decision Rules via Column Generation. NeurIPS 2018: 4660-4670 - [i4]Sanjeeb Dash, Oktay Günlük, Dennis Wei:
Boolean Decision Rules via Column Generation. CoRR abs/1805.09901 (2018) - 2017
- [j35]Amir Ali Ahmadi, Sanjeeb Dash, Georgina Hall:
Optimization over structured subsets of positive semidefinite matrices via column generation. Discret. Optim. 24: 129-151 (2017) - [j34]Merve Bodur
A new lift-and-project operator. Eur. J. Oper. Res. 257(2): 420-428 (2017) - [j33]Merve Bodur
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse. INFORMS J. Comput. 29(1): 77-91 (2017) - [j32]Merve Bodur
Cutting planes from extended LP formulations. Math. Program. 161(1-2): 159-192 (2017) - [j31]Sanjeeb Dash, Oktay Günlük
On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width. SIAM J. Optim. 27(3): 1340-1361 (2017) - 2016
- [j30]Sanjeeb Dash, Oktay Günlük
The continuous knapsack set. Math. Program. 155(1-2): 471-496 (2016) - [j29]Sanjeeb Dash, Oktay Günlük
On the polyhedrality of cross and quadrilateral closures. Math. Program. 160(1-2): 245-270 (2016) - 2015
- [j28]Sanjeeb Dash, Oktay Günlük
On the relative strength of different generalizations of split cuts. Discret. Optim. 16: 36-50 (2015) - [c8]Sanjeeb Dash, Dmitry M. Malioutov, Kush R. Varshney:
Learning interpretable classification rules using sequential rowsampling. ICASSP 2015: 3337-3341 - [i3]Amir Ali Ahmadi, Sanjeeb Dash, Georgina Hall:
Optimization over Structured Subsets of Positive Semidefinite Matrices via Column Generation. CoRR abs/1512.05402 (2015) - 2014
- [j27]Sanjeeb Dash, Oktay Günlük
Computational Experiments with Cross and Crooked Cross Cuts. INFORMS J. Comput. 26(4): 780-797 (2014) - [j26]Sanjeeb Dash, Neil B. Dobbs, Oktay Günlük
Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming. Math. Program. 145(1-2): 483-508 (2014) - [c7]Sanjeeb Dash, Dmitry M. Malioutov, Kush R. Varshney:
Screening for learning classification rules via Boolean compressed sensing. ICASSP 2014: 3360-3364 - 2013
- [j25]Sanjeeb Dash, Oktay Günlük
On t-branch split cuts for mixed-integer programs. Math. Program. 141(1-2): 591-599 (2013) - [c6]Sanjeeb Dash, Oktay Günlük, Diego Alejandro Morán Ramírez:
On Some Generalizations of the Split Closure. IPCO 2013: 145-156 - [i2]Sanjeeb Dash:
A note on QUBO instances defined on Chimera graphs. CoRR abs/1306.1202 (2013) - 2012
- [j24]Sanjeeb Dash, Oktay Günlük
A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows. INFORMS J. Comput. 24(1): 132-147 (2012) - [j23]Sanjeeb Dash, Ricardo Fukasawa
The master equality polyhedron with multiple rows. Math. Program. 132(1-2): 125-151 (2012) - [j22]Sanjeeb Dash, Santanu S. Dey
Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. Math. Program. 135(1-2): 221-254 (2012) - 2011
- [j21]Sanjeeb Dash, Oktay Günlük
A note on the MIR closure and basic relaxations of polyhedra. Oper. Res. Lett. 39(3): 198-199 (2011) - [j20]Sanjeeb Dash, Santanu S. Dey
On mixed-integer sets with two integer variables. Oper. Res. Lett. 39(5): 305-309 (2011) - [p1]Sanjeeb Dash:
Mixed Integer Rounding Cuts and Master Group Polyhedra. Combinatorial Optimization - Methods and Applications 2011: 1-32 - 2010
- [j19]Sanjeeb Dash, Marcos Goycoolea
Two-Step MIR Inequalities for Mixed Integer Programs. INFORMS J. Comput. 22(2): 236-249 (2010) - [j18]Sanjeeb Dash, Oktay Günlük
MIR closures of polyhedral sets. Math. Program. 121(1): 33-60 (2010) - [j17]Sanjeeb Dash, Oktay Günlük
Erratum to: MIR closures of polyhedral sets. Math. Program. 123(2): 485-486 (2010) - [j16]Sanjeeb Dash, Ricardo Fukasawa
On a generalization of the master cyclic group polyhedron. Math. Program. 125(1): 1-30 (2010) - [j15]Sanjeeb Dash, Marcos Goycoolea
A heuristic to generate rank-1 GMI cuts. Math. Program. Comput. 2(3-4): 231-257 (2010) - [j14]Sanjeeb Dash:
On the complexity of cutting-plane proofs using split cuts. Oper. Res. Lett. 38(2): 109-114 (2010) - [c5]Uday Bondhugula, Oktay Günlük
A model for fusion and code motion in an automatic parallelizing compiler. PACT 2010: 343-352
2000 – 2009
- 2009
- [j13]William J. Cook, Sanjeeb Dash, Ricardo Fukasawa
Numerically Safe Gomory Mixed-Integer Cuts. INFORMS J. Comput. 21(4): 641-649 (2009) - [j12]Sanjeeb Dash, Oktay Günlük
On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs. SIAM J. Optim. 20(2): 1090-1109 (2009) - 2008
- [j11]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): 241-257 (2008) - [j10]Sanjeeb Dash, Oktay Günlük
On the strength of Gomory mixed-integer cuts as group cuts. Math. Program. 115(2): 387-407 (2008) - [i1]Sanjeeb Dash:
On the complexity of cutting plane proofs using split cuts. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j9]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): 345-362 (2007) - [j8]David L. Applegate, William J. Cook, Sanjeeb Dash, Daniel G. Espinoza:
Exact solutions to linear programming problems. Oper. Res. Lett. 35(6): 693-699 (2007) - [j7]Ramesh Neelamani, Sanjeeb Dash, Richard G. Baraniuk:
On Nearly Orthogonal Lattice Bases and Random Lattices. SIAM J. Discret. Math. 21(1): 199-219 (2007) - [c4]Sanjeeb Dash, Ricardo Fukasawa
On a Generalization of the Master Cyclic Group Polyhedron. IPCO 2007: 197-209 - [c3]Sanjeeb Dash, Oktay Günlük, Andrea Lodi:
On the MIR Closure of Polyhedra. IPCO 2007: 337-351 - 2006
- [j6]Sanjeeb Dash, Oktay Günlük
Valid inequalities based on simple mixed-integer sets. Math. Program. 105(1): 29-53 (2006) - [j5]Sanjeeb Dash, Oktay Günlük
Valid inequalities based on the interpolation procedure. Math. Program. 106(1): 111-136 (2006) - [j4]Ramesh Neelamani, Ricardo L. de Queiroz
JPEG compression history estimation for color images. IEEE Trans. Image Process. 15(6): 1365-1378 (2006) - 2005
- [j3]Sanjeeb Dash:
Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs. Math. Oper. Res. 30(3): 678-700 (2005) - 2004
- [c2]Sanjeeb Dash, Oktay Günlük:
Valid Inequalities Based on Simple Mixed-Integer Sets. IPCO 2004: 33-45 - 2002
- [j2]David L. Applegate, William J. Cook, Sanjeeb Dash, André Rohe:
Solution of a Min-Max Vehicle Routing Problem. INFORMS J. Comput. 14(2): 132-143 (2002) - [c1]Sanjeeb Dash:
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs. IPCO 2002: 145-160 - 2001
- [j1]William J. Cook, Sanjeeb Dash:
On the Matrix-Cut Rank of Polyhedra. Math. Oper. Res. 26(1): 19-30 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: