Oktay Günlük

92 papers A* 6B 10C 2Journal 72Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Parallel token swapping for qubit routing.
Discret. Appl. Math.
Ishan Bansal, Oktay Günlük, Richard Shapley
2025 J jnl
Recovering Dantzig-Wolfe Bounds by Cutting Planes.
Oper. Res.
Rui Chen, Oktay Günlük, Andrea Lodi
2025 J jnl
Robust-to-Dynamics Optimization.
Math. Oper. Res.
Amir Ali Ahmadi, Oktay Günlük
2024 J jnl
Binary Matrix Factorization and Completion via Integer Programming.
Math. Oper. Res.
Oktay Günlük, Raphael Andreas Hauser, Réka Ágnes Kovács
2024 J jnl
Fair Minimum Representation Clustering via Integer Programming.
CoRR
Connor Lawless, Oktay Günlük
2024 — conf
Fair Minimum Representation Clustering.
CPAIOR (2)
Connor Lawless, Oktay Günlük
2024 J jnl
Parallel Token Swapping for Qubit Routing.
CoRR
Ishan Bansal, Oktay Günlük, Richard Shapley
2024 J jnl
Warehouse Problem with Multiple Vendors and Generalized Complementarity Constraints.
CoRR
Ishan Bansal, Oktay Günlük
2023 A* conf
Cluster Explanation via Polyhedral Descriptions.
ICML
Connor Lawless, Oktay Günlük
2023 J jnl
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions.
Discret. Optim.
Rui Chen, Sanjeeb Dash, Oktay Günlük
2023 J jnl
Fair Minimum Representation Clustering.
CoRR
Connor Lawless, Oktay Günlük
2023 J jnl
Interpretable and Fair Boolean Rule Sets via Column Generation.
J. Mach. Learn. Res.
Connor Lawless, Sanjeeb Dash, Oktay Günlük, Dennis Wei
2023 J jnl
Multilinear sets with two monomials and cardinality constraints.
Discret. Appl. Math.
Rui Chen, Sanjeeb Dash, Oktay Günlük
2023 J jnl
Optimal Qubit Assignment and Routing via Integer Programming.
ACM Trans. Quantum Comput.
Giacomo Nannicini, Lev S. Bishop, Oktay Günlük, Petar Jurcevic
2023 J jnl
Special Issue: International Symposium on Mathematical Programming 2022.
Math. Program.
Damek Shea Davis, Oktay Günlük, Volker Kaibel, Giacomo Nannicini, Xa-Xiang Yuan
2023 J jnl
Warehouse Problem with Bounds, Fixed Costs and Complementarity Constraints.
CoRR
Ishan Bansal, Oktay Günlük
2022 J jnl
A Simple Algorithm for Online Decision Making.
CoRR
Rui Chen, Oktay Günlük, Andrea Lodi, Guanyi Wang
2022 J jnl
Cluster Explanation via Polyhedral Descriptions.
CoRR
Connor Lawless, Oktay Günlük
2022 J jnl
On a generalization of the Chvátal-Gomory closure.
Math. Program.
Sanjeeb Dash, Oktay Günlük, Dabeen Lee
2021 J jnl
Binary Matrix Factorisation and Completion via Integer Programming.
CoRR
Réka Á. Kovács, Oktay Günlük, Raphael A. Hauser
2021 A* conf
Binary Matrix Factorisation via Column Generation.
AAAI
Réka Á. Kovács, Oktay Günlük, Raphael A. Hauser
2021 J jnl
Fair Decision Rules for Binary Classification.
CoRR
Connor Lawless, Oktay Günlük
2021 J jnl
Generalized Chvátal-Gomory closures for integer programs with bounds on variables.
Math. Program.
Sanjeeb Dash, Oktay Günlük, Dabeen Lee
2021 J jnl
Interpretable and Fair Boolean Rule Sets via Column Generation.
CoRR
Connor Lawless, Sanjeeb Dash, Oktay Günlük, Dennis Wei
2021 J jnl
Optimal decision trees for categorical data via integer programming.
J. Glob. Optim.
Oktay Günlük, Jayant Kalagnanam, Minhan Li, Matt Menickelly, Katya Scheinberg
2020 J jnl
Binary Matrix Factorisation via Column Generation.
CoRR
Réka Á. Kovács, Oktay Günlük, Raphael A. Hauser
2020 C conf
Cardinality Constrained Multilinear Sets.
ISCO
Rui Chen, Sanjeeb Dash, Oktay Günlük
2020 C ed.
Combinatorial Optimization - 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4-6, 2020, Revised Selected Papers
ISCO
Mourad Baïou, Bernard Gendron, Oktay Günlük, Ali Ridha Mahjoub
2020 J jnl
Lattice closures of polyhedra.
Math. Program.
Sanjeeb Dash, Oktay Günlük, Diego A. Morán R.
2020 A* conf
Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping.
NeurIPS
Shashanka Ubaru, Sanjeeb Dash, Arya Mazumdar, Oktay Günlük
2020 J jnl
Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping.
CoRR
Shashanka Ubaru, Sanjeeb Dash, Arya Mazumdar, Oktay Günlük
2020 B conf
On a Generalization of the Chvátal-Gomory Closure.
IPCO
Sanjeeb Dash, Oktay Günlük, Dabeen Lee
2019 A* conf
Generalized Linear Rule Models.
ICML
Dennis Wei, Sanjeeb Dash, Tian Gao, Oktay Günlük
2019 J jnl
Generalized Linear Rule Models.
CoRR
Dennis Wei, Sanjeeb Dash, Tian Gao, Oktay Günlük
2018 J jnl
A note on capacity models for network design.
Oper. Res. Lett.
Alper Atamtürk, Oktay Günlük
2018 J jnl
Binary extended formulations of polyhedral mixed-integer sets.
Math. Program.
Sanjeeb Dash, Oktay Günlük, Robert Hildebrand
2018 A* conf
Boolean Decision Rules via Column Generation.
NeurIPS
Sanjeeb Dash, Oktay Günlük, Dennis Wei
2018 J jnl
Boolean Decision Rules via Column Generation.
CoRR
Sanjeeb Dash, Oktay Günlük, Dennis Wei
2018 J jnl
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods.
Math. Program. Comput.
Pierre Bonami, Oktay Günlük, Jeff T. Linderoth
2018 J jnl
Low-Rank Boolean Matrix Approximation by Integer Programming.
CoRR
Réka Kovács, Oktay Günlük, Raphael A. Hauser
2018 J jnl
Robust-to-Dynamics Optimization.
CoRR
Amir Ali Ahmadi, Oktay Günlük
2017 J jnl
A new lift-and-project operator.
Eur. J. Oper. Res.
Merve Bodur, Sanjeeb Dash, Oktay Günlük
2017 J jnl
Cutting planes from extended LP formulations.
Math. Program.
Merve Bodur, Sanjeeb Dash, Oktay Günlük
2017 J jnl
On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width.
SIAM J. Optim.
Sanjeeb Dash, Oktay Günlük, Diego A. Morán R.
2017 J jnl
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse.
INFORMS J. Comput.
Merve Bodur, Sanjeeb Dash, Oktay Günlük, James R. Luedtke
2016 J jnl
On the polyhedrality of cross and quadrilateral closures.
Math. Program.
Sanjeeb Dash, Oktay Günlük, Diego A. Morán R.
2016 J jnl
Optimal Generalized Decision Trees via Integer Programming.
CoRR
Matt Menickelly, Oktay Günlük, Jayant Kalagnanam, Katya Scheinberg
2016 J jnl
The continuous knapsack set.
Math. Program.
Sanjeeb Dash, Oktay Günlük, Laurence A. Wolsey
2015 J jnl
Discretization vertex orders in distance geometry.
Discret. Appl. Math.
Andrea Cassioli, Oktay Günlük, Carlile Lavor, Leo Liberti
2015 J jnl
On the relative strength of different generalizations of split cuts.
Discret. Optim.
Sanjeeb Dash, Oktay Günlük, Marco Molinaro
2015 — conf
Robust-to-dynamics linear programming.
CDC
Amir Ali Ahmadi, Oktay Günlük
2014 J jnl
Computational Experiments with Cross and Crooked Cross Cuts.
INFORMS J. Comput.
Sanjeeb Dash, Oktay Günlük, Juan Pablo Vielma
2014 J jnl
Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming.
Math. Program.
Sanjeeb Dash, Neil B. Dobbs, Oktay Günlük, Tomasz Nowicki, Grzegorz Swirszcz
2014 B conf
Robust confidentiality preserving data delivery in federated coalition networks.
Networking
Lu Su, Yunlong Gao, Fan Ye, Peng Liu, Oktay Günlük, Tom Bcrman, Seraphin B. Calo, Tarek F. Abdelzaher
2013 B conf
On Some Generalizations of the Split Closure.
IPCO
Sanjeeb Dash, Oktay Günlük, Diego Alejandro Morán Ramírez
2013 J jnl
On t-branch split cuts for mixed-integer programs.
Math. Program.
Sanjeeb Dash, Oktay Günlük
2012 J jnl
A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows.
INFORMS J. Comput.
Sanjeeb Dash, Oktay Günlük, Andrea Lodi, Andrea Tramontani
2012 J jnl
The master equality polyhedron with multiple rows.
Math. Program.
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük
2012 J jnl
Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra.
Math. Program.
Sanjeeb Dash, Santanu S. Dey, Oktay Günlük
2011 J jnl
A note on the MIR closure and basic relaxations of polyhedra.
Oper. Res. Lett.
Sanjeeb Dash, Oktay Günlük, Christian Raack
2011 B ed.
Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings
IPCO
Oktay Günlük, Gerhard J. Woeginger
2011 J jnl
On mixed-integer sets with two integer variables.
Oper. Res. Lett.
Sanjeeb Dash, Santanu S. Dey, Oktay Günlük
2011 J jnl
Strengthening lattice-free cuts using non-negativity.
Discret. Optim.
Ricardo Fukasawa, Oktay Günlük
2010 B conf
A model for fusion and code motion in an automatic parallelizing compiler.
PACT
Uday Bondhugula, Oktay Günlük, Sanjeeb Dash, Lakshminarayanan Renganarayanan
2010 J jnl
Erratum to: MIR closures of polyhedral sets.
Math. Program.
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
2010 J jnl
MIR closures of polyhedral sets.
Math. Program.
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
2010 J jnl
Mingling: mixed-integer rounding with bounds.
Math. Program.
Alper Atamtürk, Oktay Günlük
2010 J jnl
On a generalization of the master cyclic group polyhedron.
Math. Program.
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük
2010 J jnl
Perspective reformulations of mixed integer nonlinear programs with indicator variables.
Math. Program.
Oktay Günlük, Jeff T. Linderoth
2010 J jnl
Two-Step MIR Inequalities for Mixed Integer Programs.
INFORMS J. Comput.
Sanjeeb Dash, Marcos Goycoolea, Oktay Günlük
2009 J jnl
On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs.
SIAM J. Optim.
Sanjeeb Dash, Oktay Günlük
2008 J jnl
A pricing problem under Monge property.
Discret. Optim.
Oktay Günlük
2008 J jnl
On the strength of Gomory mixed-integer cuts as group cuts.
Math. Program.
Sanjeeb Dash, Oktay Günlük
2008 B conf
Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables.
IPCO
Oktay Günlük, Jeff T. Linderoth
2007 J jnl
A New Min-Cut Max-Flow Ratio for Multicommodity Flows.
SIAM J. Discret. Math.
Oktay Günlük
2007 J jnl
Network design arc set with variable upper bounds.
Networks
Alper Atamtürk, Oktay Günlük
2007 B conf
On a Generalization of the Master Cyclic Group Polyhedron.
IPCO
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük
2007 B conf
On the MIR Closure of Polyhedra.
IPCO
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
2006 J jnl
Valid inequalities based on simple mixed-integer sets.
Math. Program.
Sanjeeb Dash, Oktay Günlük
2006 J jnl
Valid inequalities based on the interpolation procedure.
Math. Program.
Sanjeeb Dash, Oktay Günlük
2006 J jnl
Vehicle Routing and Staffing for Sedan Service.
Transp. Sci.
Oktay Günlük, Tracy Kimbrel, Laszlo Ladányi, Baruch Schieber, Gregory B. Sorkin
2005 J jnl
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions.
Manag. Sci.
Oktay Günlük, Laszlo Ladányi, Sven de Vries
2004 B conf
Valid Inequalities Based on Simple Mixed-Integer Sets.
IPCO
Sanjeeb Dash, Oktay Günlük
2002 B conf
A New Min-Cut Max-Flow Ratio for Multicommodity Flows.
IPCO
Oktay Günlük
2001 J jnl
Mixing mixed-integer inequalities.
Math. Program.
Oktay Günlük, Yves Pochet
2000 J jnl
The multicast packing problem.
IEEE/ACM Trans. Netw.
Shiwen Chen, Oktay Günlük, Bülent Yener
1999 J jnl
A branch-and-cut algorithm for capacitated network design problems.
Math. Program.
Oktay Günlük
1998 J jnl
Minimum cost capacity installation for multicommodity network flows.
Math. Program.
Daniel Bienstock, Sunil Chopra, Oktay Günlük, Chih-Yang Tsai
1998 A* conf
Optimal Packing of Group Multi-Casting.
INFOCOM
Shiwen Chen, Oktay Günlük, Bülent Yener
1996 J jnl
Capacitated Network Design - Polyhedral Structure and Computation.
INFORMS J. Comput.
Daniel Bienstock, Oktay Günlük
1995 J jnl
Computational experience with a difficult mixed-integer multicommodity flow problem.
Math. Program.
Daniel Bienstock, Oktay Günlük
1994 J jnl
A degree sequence problem related to network design.
Networks
Daniel Bienstock, Oktay Günlük