Остановите войну!
for scientists:
default search action
Sanjeeb Dash
- > Home > Persons > Sanjeeb Dash
Publications
- 2023
- [j42]Rui Chen, Sanjeeb Dash, Oktay Günlük:
Multilinear sets with two monomials and cardinality constraints. Discret. Appl. Math. 324: 67-79 (2023) - [j41]Rui Chen, Sanjeeb Dash, Oktay Günlük:
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) - 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) - 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) - [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, Oktay Günlük, Diego A. Morán R.:
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, Sanjeeb Dash, Oktay Günlük:
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 - [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) - 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, Robert Hildebrand:
Binary extended formulations of polyhedral mixed-integer sets. Math. Program. 170(1): 207-236 (2018) - [c9]Sanjeeb Dash, Oktay Günlük, Dennis Wei:
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
- [j34]Merve Bodur, Sanjeeb Dash, Oktay Günlük:
A new lift-and-project operator. Eur. J. Oper. Res. 257(2): 420-428 (2017) - [j33]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): 77-91 (2017) - [j32]Merve Bodur, Sanjeeb Dash, Oktay Günlük:
Cutting planes from extended LP formulations. Math. Program. 161(1-2): 159-192 (2017) - [j31]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): 1340-1361 (2017) - 2016
- [j30]Sanjeeb Dash, Oktay Günlük, Laurence A. Wolsey:
The continuous knapsack set. Math. Program. 155(1-2): 471-496 (2016) - [j29]Sanjeeb Dash, Oktay Günlük, Diego A. Morán R.:
On the polyhedrality of cross and quadrilateral closures. Math. Program. 160(1-2): 245-270 (2016) - 2015
- [j28]Sanjeeb Dash, Oktay Günlük, Marco Molinaro:
On the relative strength of different generalizations of split cuts. Discret. Optim. 16: 36-50 (2015) - 2014
- [j27]Sanjeeb Dash, Oktay Günlük, Juan Pablo Vielma:
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, Tomasz Nowicki, Grzegorz Swirszcz:
Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming. Math. Program. 145(1-2): 483-508 (2014) - 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 - 2012
- [j24]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): 132-147 (2012) - [j23]Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük:
The master equality polyhedron with multiple rows. Math. Program. 132(1-2): 125-151 (2012) - [j22]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): 221-254 (2012) - 2011
- [j21]Sanjeeb Dash, Oktay Günlük, Christian Raack:
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, Oktay Günlük:
On mixed-integer sets with two integer variables. Oper. Res. Lett. 39(5): 305-309 (2011) - 2010
- [j19]Sanjeeb Dash, Marcos Goycoolea, Oktay Günlük:
Two-Step MIR Inequalities for Mixed Integer Programs. INFORMS J. Comput. 22(2): 236-249 (2010) - [j18]Sanjeeb Dash, Oktay Günlük, Andrea Lodi:
MIR closures of polyhedral sets. Math. Program. 121(1): 33-60 (2010) - [j17]Sanjeeb Dash, Oktay Günlük, Andrea Lodi:
Erratum to: MIR closures of polyhedral sets. Math. Program. 123(2): 485-486 (2010) - [j16]Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük:
On a generalization of the master cyclic group polyhedron. Math. Program. 125(1): 1-30 (2010) - [c5]Uday Bondhugula, Oktay Günlük, Sanjeeb Dash, Lakshminarayanan Renganarayanan:
A model for fusion and code motion in an automatic parallelizing compiler. PACT 2010: 343-352 - 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
- [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) - 2007
- [c4]Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük:
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) - 2004
- [c2]Sanjeeb Dash, Oktay Günlük:
Valid Inequalities Based on Simple Mixed-Integer Sets. IPCO 2004: 33-45
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-04-25 02:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint