default search action
Oktay Günlük
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j51]Oktay Günlük
, Raphael Andreas Hauser
Binary Matrix Factorization and Completion via Integer Programming. Math. Oper. Res. 49(2): 1278-1302 (2024) - [c18]Connor Lawless, Oktay Günlük:
Fair Minimum Representation Clustering. CPAIOR (2) 2024: 20-37 - [i16]Ishan Bansal, Oktay Günlük:
Warehouse Problem with Multiple Vendors and Generalized Complementarity Constraints. CoRR abs/2401.10738 (2024) - [i15]Connor Lawless, Oktay Günlük:
Fair Minimum Representation Clustering via Integer Programming. CoRR abs/2409.02963 (2024) - 2023
- [j50]Rui Chen
Multilinear sets with two monomials and cardinality constraints. Discret. Appl. Math. 324: 67-79 (2023) - [j49]Rui Chen
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions. Discret. Optim. 50: 100804 (2023) - [j48]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) - [j47]Damek Shea Davis, Oktay Günlük, Volker Kaibel, Giacomo Nannicini, Xa-Xiang Yuan:
Special Issue: International Symposium on Mathematical Programming 2022. Math. Program. 200(2): 629-631 (2023) - [c17]Connor Lawless, Oktay Günlük:
Cluster Explanation via Polyhedral Descriptions. ICML 2023: 18652-18666 - [i14]Connor Lawless, Oktay Günlük:
Fair Minimum Representation Clustering. CoRR abs/2302.03151 (2023) - [i13]Ishan Bansal, Oktay Günlük:
Warehouse Problem with Bounds, Fixed Costs and Complementarity Constraints. CoRR abs/2302.12136 (2023) - 2022
- [j46]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]Connor Lawless, Oktay Günlük:
Cluster Explanation via Polyhedral Descriptions. CoRR abs/2210.08798 (2022) - [i11]Rui Chen, Oktay Günlük, Andrea Lodi, Guanyi Wang:
A Simple Algorithm for Online Decision Making. CoRR abs/2211.03997 (2022) - 2021
- [j45]Oktay Günlük, Jayant Kalagnanam, Minhan Li, Matt Menickelly, Katya Scheinberg
Optimal decision trees for categorical data via integer programming. J. Glob. Optim. 81(1): 233-260 (2021) - [j44]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) - [c16]Réka Á. Kovács, Oktay Günlük, Raphael A. Hauser:
Binary Matrix Factorisation via Column Generation. AAAI 2021: 3823-3831 - [i10]Réka Á. Kovács, Oktay Günlük, Raphael A. Hauser:
Binary Matrix Factorisation and Completion via Integer Programming. CoRR abs/2106.13434 (2021) - [i9]Connor Lawless, Oktay Günlük:
Fair Decision Rules for Binary Classification. CoRR abs/2107.01325 (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
- [j43]Sanjeeb Dash
Lattice closures of polyhedra. Math. Program. 181(1): 119-147 (2020) - [c15]Sanjeeb Dash, Oktay Günlük, Dabeen Lee:
On a Generalization of the Chvátal-Gomory Closure. IPCO 2020: 117-129 - [c14]Rui Chen
Cardinality Constrained Multilinear Sets. ISCO 2020: 54-65 - [c13]Shashanka Ubaru, Sanjeeb Dash, Arya Mazumdar, Oktay Günlük:
Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping. NeurIPS 2020 - [e2]Mourad Baïou
Combinatorial Optimization - 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4-6, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12176, Springer 2020, ISBN 978-3-030-53261-1 [contents] - [i7]Shashanka Ubaru, Sanjeeb Dash, Arya Mazumdar, Oktay Günlük:
Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping. CoRR abs/2006.14084 (2020) - [i6]Réka Á. Kovács, Oktay Günlük, Raphael A. Hauser:
Binary Matrix Factorisation via Column Generation. CoRR abs/2011.04457 (2020)
2010 – 2019
- 2019
- [c12]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
- [j42]Sanjeeb Dash, Oktay Günlük
Binary extended formulations of polyhedral mixed-integer sets. Math. Program. 170(1): 207-236 (2018) - [j41]Pierre Bonami, Oktay Günlük
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods. Math. Program. Comput. 10(3): 333-382 (2018) - [j40]Alper Atamtürk, Oktay Günlük
A note on capacity models for network design. Oper. Res. Lett. 46(4): 414-417 (2018) - [c11]Sanjeeb Dash, Oktay Günlük
Boolean Decision Rules via Column Generation. NeurIPS 2018: 4660-4670 - [i4]Réka Kovács, Oktay Günlük, Raphael A. Hauser:
Low-Rank Boolean Matrix Approximation by Integer Programming. CoRR abs/1803.04825 (2018) - [i3]Amir Ali Ahmadi, Oktay Günlük:
Robust-to-Dynamics Optimization. CoRR abs/1805.03682 (2018) - [i2]Sanjeeb Dash, Oktay Günlük, Dennis Wei:
Boolean Decision Rules via Column Generation. CoRR abs/1805.09901 (2018) - 2017
- [j39]Merve Bodur
A new lift-and-project operator. Eur. J. Oper. Res. 257(2): 420-428 (2017) - [j38]Merve Bodur
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse. INFORMS J. Comput. 29(1): 77-91 (2017) - [j37]Merve Bodur
Cutting planes from extended LP formulations. Math. Program. 161(1-2): 159-192 (2017) - [j36]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
- [j35]Sanjeeb Dash, Oktay Günlük
The continuous knapsack set. Math. Program. 155(1-2): 471-496 (2016) - [j34]Sanjeeb Dash, Oktay Günlük
On the polyhedrality of cross and quadrilateral closures. Math. Program. 160(1-2): 245-270 (2016) - [i1]Matt Menickelly, Oktay Günlük, Jayant Kalagnanam, Katya Scheinberg:
Optimal Generalized Decision Trees via Integer Programming. CoRR abs/1612.03225 (2016) - 2015
- [j33]Andrea Cassioli, Oktay Günlük
Discretization vertex orders in distance geometry. Discret. Appl. Math. 197: 27-41 (2015) - [j32]Sanjeeb Dash, Oktay Günlük
On the relative strength of different generalizations of split cuts. Discret. Optim. 16: 36-50 (2015) - [c10]Amir Ali Ahmadi, Oktay Günlük
Robust-to-dynamics linear programming. CDC 2015: 5915-5919 - 2014
- [j31]Sanjeeb Dash, Oktay Günlük
Computational Experiments with Cross and Crooked Cross Cuts. INFORMS J. Comput. 26(4): 780-797 (2014) - [j30]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) - [c9]Lu Su, Yunlong Gao, Fan Ye, Peng Liu, Oktay Günlük
Robust confidentiality preserving data delivery in federated coalition networks. Networking 2014: 1-9 - 2013
- [j29]Sanjeeb Dash, Oktay Günlük
On t-branch split cuts for mixed-integer programs. Math. Program. 141(1-2): 591-599 (2013) - [c8]Sanjeeb Dash, Oktay Günlük, Diego Alejandro Morán Ramírez:
On Some Generalizations of the Split Closure. IPCO 2013: 145-156 - 2012
- [j28]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) - [j27]Sanjeeb Dash, Ricardo Fukasawa
The master equality polyhedron with multiple rows. Math. Program. 132(1-2): 125-151 (2012) - [j26]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
- [j25]Ricardo Fukasawa
Strengthening lattice-free cuts using non-negativity. Discret. Optim. 8(2): 229-245 (2011) - [j24]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) - [j23]Sanjeeb Dash, Santanu S. Dey
On mixed-integer sets with two integer variables. Oper. Res. Lett. 39(5): 305-309 (2011) - [e1]Oktay Günlük
Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings. Lecture Notes in Computer Science 6655, Springer 2011, ISBN 978-3-642-20806-5 [contents] - 2010
- [j22]Sanjeeb Dash, Marcos Goycoolea
Two-Step MIR Inequalities for Mixed Integer Programs. INFORMS J. Comput. 22(2): 236-249 (2010) - [j21]Sanjeeb Dash, Oktay Günlük
MIR closures of polyhedral sets. Math. Program. 121(1): 33-60 (2010) - [j20]Alper Atamtürk, Oktay Günlük
Mingling: mixed-integer rounding with bounds. Math. Program. 123(2): 315-338 (2010) - [j19]Sanjeeb Dash, Oktay Günlük
Erratum to: MIR closures of polyhedral sets. Math. Program. 123(2): 485-486 (2010) - [j18]Oktay Günlük
Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Program. 124(1-2): 183-205 (2010) - [j17]Sanjeeb Dash, Ricardo Fukasawa
On a generalization of the master cyclic group polyhedron. Math. Program. 125(1): 1-30 (2010) - [c7]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
- [j16]Sanjeeb Dash, Oktay Günlük
On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs. SIAM J. Optim. 20(2): 1090-1109 (2009) - 2008
- [j15]Oktay Günlük
A pricing problem under Monge property. Discret. Optim. 5(2): 328-336 (2008) - [j14]Sanjeeb Dash, Oktay Günlük
On the strength of Gomory mixed-integer cuts as group cuts. Math. Program. 115(2): 387-407 (2008) - [c6]Oktay Günlük, Jeff T. Linderoth:
Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables. IPCO 2008: 1-16 - 2007
- [j13]Alper Atamtürk, Oktay Günlük
Network design arc set with variable upper bounds. Networks 50(1): 17-28 (2007) - [j12]Oktay Günlük
A New Min-Cut Max-Flow Ratio for Multicommodity Flows. SIAM J. Discret. Math. 21(1): 1-15 (2007) - [c5]Sanjeeb Dash, Ricardo Fukasawa
On a Generalization of the Master Cyclic Group Polyhedron. IPCO 2007: 197-209 - [c4]Sanjeeb Dash, Oktay Günlük, Andrea Lodi:
On the MIR Closure of Polyhedra. IPCO 2007: 337-351 - 2006
- [j11]Sanjeeb Dash, Oktay Günlük
Valid inequalities based on simple mixed-integer sets. Math. Program. 105(1): 29-53 (2006) - [j10]Sanjeeb Dash, Oktay Günlük
Valid inequalities based on the interpolation procedure. Math. Program. 106(1): 111-136 (2006) - [j9]Oktay Günlük
Vehicle Routing and Staffing for Sedan Service. Transp. Sci. 40(3): 313-326 (2006) - 2005
- [j8]Oktay Günlük
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions. Manag. Sci. 51(3): 391-406 (2005) - 2004
- [c3]Sanjeeb Dash, Oktay Günlük:
Valid Inequalities Based on Simple Mixed-Integer Sets. IPCO 2004: 33-45 - 2002
- [c2]Oktay Günlük:
A New Min-Cut Max-Flow Ratio for Multicommodity Flows. IPCO 2002: 54-66 - 2001
- [j7]Oktay Günlük
Mixing mixed-integer inequalities. Math. Program. 90(3): 429-457 (2001) - 2000
- [j6]Shiwen Chen, Oktay Günlük
The multicast packing problem. IEEE/ACM Trans. Netw. 8(3): 311-318 (2000)
1990 – 1999
- 1999
- [j5]Oktay Günlük
A branch-and-cut algorithm for capacitated network design problems. Math. Program. 86(1): 17-39 (1999) - 1998
- [j4]Daniel Bienstock, Sunil Chopra
Minimum cost capacity installation for multicommodity network flows. Math. Program. 81: 177-199 (1998) - [c1]Shiwen Chen, Oktay Günlük
Optimal Packing of Group Multi-Casting. INFOCOM 1998: 980-987 - 1996
- [j3]Daniel Bienstock, Oktay Günlük
Capacitated Network Design - Polyhedral Structure and Computation. INFORMS J. Comput. 8(3): 243-259 (1996) - 1995
- [j2]Daniel Bienstock, Oktay Günlük
Computational experience with a difficult mixed-integer multicommodity flow problem. Math. Program. 68: 213-237 (1995) - 1994
- [j1]Daniel Bienstock, Oktay Günlük
A degree sequence problem related to network design. Networks 24(4): 195-205 (1994)
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-22 20:11 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: