 Demonstration of quantum volume 64 on a superconducting quantum computing system with Jurcevic, JavadiAbhari, Bishop, Lauer, Bogorin, Brink, Capellut, Itoko, Kanazawa, Kandala, Keefe, Krsulich, Landers, Lewandowski, McClure, Nannicini, Narasgond, Nayfeh, Pritchett, Rothwell, Srinivasan, Sundaresan, Wang, Wei, Wood, Yau, Zhang, Dial, Chow, and Gambetta, Quantum Science and Technology, to appear.
 Multilinear Sets with Cardinality Constraints with Rui Chen and Dash, submitted.
 On a generalization of the ChvatalGomory closure with Dash and Dabeen Lee, submitted.
 Generalized ChvatalGomory closures for integer programs with bounds on variables, with Dash and Dabeen Lee, Math. Programming, to appear.
 RobusttoDynamics Optimization, with Ahmadi, submitted.
 Optimal decision trees for categorical data via integer programming, with Kalagnanam, Menickelly, and Scheinberg, submitted.
 Binary extended formulations of polyhedral mixedinteger sets, with Dash and Hildebrand, Math. Programming, 170(1), 207236 (2018).
 On capacity models for network design, with Atamturk, OR Letters, 46, 414–417 (2018).
 Lattice closures of polyhedra,
with Dash and Moran, Math. Programming, 182(1), 119147 (2020).
 On the polyhedrality of closures of multibranch split sets and other polyhedra with bounded maxfacetwidth,
with Dash and Moran, SIAM J. Optimization 273,13401361 (2017).
 Solving BoxConstrained Nonconvex Quadratic Programs,
with Bonami and Linderoth, Math. Programming Computation, 10(3), 333382 (2018).
 A new liftandproject operator,
with Bodur and Dash, EJOR, 257(2), 420428 (2017).
 Cutting planes derived from extended LP formulations,
with Bodur and Dash, Math. Programming, 161(12), 159192 (2017).
 On the polyhedrality of cross and quadrilateral closures,
with Dash and Moran, Math. Programming, 160(1), 245270 (2016).
 Discretization vertex orders in distance geometry,
with Cassioli, Lavor and Liberti, Discrete Applied Mathematics, 197C, 2741 (2015).
 Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse,
with Bodur, Dash and Luedtke, Informs J. on Computing,29(1), pp. 77–91 (2017).
 The continuous knapsack set,
with Dash and Wolsey, Math. Programming, 155, 471496 (2016).
 On the Relative Strength of Different Generalizations of Split Cuts,
with Dash and Molinaro, Discrete Optimization, 16, 3650 (2015).
 On tbranch split cuts for mixedinteger programs,
with Dash, Math. Programming, 141, 591–599, (2013).
 Latticefree sets, branching disjunctions, and mixedinteger programming,
with Dash, Dobbs, Nowicki,and Swirszcz, Math. Programming, 145, 483508 (2014).
 Computational Experiments with Cross and Crooked Cross Cuts,
with Dash and Vielma, Informs J. on Computing, 26, 780797 (2014).
 A note on the MIR closure and basic relaxations of polyhedra,
with Dash and Raack, OR Letters,
39, 198199 (2011)
 On mixedinteger sets with two integer variables,
with Dash and Dey, OR Letters, 39, 305309 (2011)
 Two dimensional latticefree cuts and asymmetric disjunctions for
mixedinteger polyhedra,
with Dash and Dey, Math. Programming, 135, 221254 (2012).
 A Time Bucket Formulation for the TSP with Time Windows,
with Dash, Lodi and Tramontani, Informs J. on Computing, 24, 132147 (2012).
 Strengthening latticefree cuts using nonnegativity,
with Fukasawa, Discrete Optimization 8, 229245 (2011)

The master equality polyhedron with multiple rows,
with Dash and Fukasawa, in Math. Programming, 132, 125151 (2012)

On mixing inequalities: rank, closure and cutting plane proofs,
with Dash, SIAM J. on Optimization 20, 10901109 (2009)

Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables, with Linderoth, Math. Programming, 124, 183205 (2010).

Mingling: MixedInteger Rounding with Bounds,
with Atamturk, Math. Programming, 123, 315338 (2010).
 MIR Closures of Polyhedral Sets,
with Dash and Lodi, Math. Programming, 121, 3360 (2010).

On a Generalization of the Master Cyclic Group Polyhedron,
with Dash and Fukasawa, Math. Programming, 125, 130 (2010).

On the strength of Gomory mixedinteger cuts as group cuts, with Dash,
Math. Programming, 115, 387407 (2008).

Two step MIR inequalities for mixedinteger programs,
with Dash and Goycoolea, Informs J. on Computing, 22, 236249 (2010).

A pricing problem under Monge property,
Discrete Optimization, 5, 328336, 2008.

Network Design Arc Set with Variable Upper Bounds,
with Atamturk, Networks 50, 1728, (2007).

Vehicle Routing and Staffing for Sedan Service,
with Kimbrel, Ladanyi, Schieber and Sorkin,
Transportation Science, 40, 313326 (2006).

Valid Inequalities Based on the Interpolation Procedure,
with Dash, Math. Programming, 106, 111136 (2006).

Valid Inequalities Based on Simple Mixedinteger Sets,
with Dash, Math. Programming, 105, 2953 (2006).

A BranchandPrice Algorithm and New Test Problems for Spectrum Auctions,
with Ladanyi and de Vries, Management Science, 51, 391406 (2005).

Reformulating LPs with Transport. Const.  App. to Workforce Scheduling,
with Cezik, Naval Research Logistics, 51, 258274 (2004).

Robust Capacity Planning in Semiconductor Manufacturing,
with Barahona, Bermon and Hood, Naval Research Logistics, 51, 258274 (2004).

A New MinCut MaxFlow Ratio for Multicommodity Flows,
SIAM J. of Disc. Math., 21, pp. 115 (2007).
 Mixing MixedInteger Inequalities,
with Pochet, Math. Programming, 90, 429457 (2001).
 An Integer Programming Model for the Weekly Tour Scheduling Problem,
with Cezik and Luss, Naval Research Logistics, 48, 607624 (2001).
 A BranchandCut Algorithm for Capacitated Network Design Problems,
Math. Programming, 86, 1739 (1999).
 The Multicast Packing Problem,
with Chen and Yener, IEEE Transactions on Networking, 8, 311318 (2000).
 Designing Private Line Networks  Polyhedral Analysis and Computation,
with Brockmuller and Wolsey, CORE  DP 9647.
(a shorter version appeared in Transactions on Operational Research, 16, 724 (2004))
 Minimum Cost Capacity Installation for Multicommodity Network Flows,
with Bienstock, Chopra and Tsai, Math. Programming, 81, 177199 (1998).
 Capacitated Network Design  Polyhedral Structure and Computation,
with Bienstock, Informs J. on Computing, 8, 243259, (1996).
(pdf)

Computational Experience with a Difficult Multicommodity Flow Problem,
with Bienstock, Math. Programming, 68, 213238 (1995).

A Degree Sequence Problem Related to Network Design,
with Bienstock, Networks, 24, 195205 (1994).
 Maintenance of a Device with AgeDependent Exponential Failures,
with Ozekici, Naval Research Logistics, 39, 699714 (1992).
Book Chapters Multicommodity multifacility network design, with Atamturk, in Network Design with Applications to Transportation and Logistics, edited by Crainic, Gendreau and Gendron, Springer, to appear.
 Perspective Reformulation and Applications, with Linderoth, in MINLP, IMA Volumes in Math. and Its Applications, vol 154, edited by Lee and Leyffer, Springer, 2012.
 MINLP Strengthening for Separable Convex Quadratic TransportationCost UFL, with Lee and Weismantel, IBM technical report RC24213 (2007).
 A Polytope for a Product of Real Linear Functions in 0/1 Variables, with Lee and Leung, in MINLP, IMA Volumes in Math. and Its Applications, vol 154, edited by Lee and Leyffer, Springer, 2012. (Original version appeared as IBM technical report, 2003).
Conference Papers Binary Matrix Factorization via Column Generation, with Hauser and Kovacs, AAAI 2021. Multilabel Classification by Hierarchical Partitioning and Datadependent Grouping, with Ubaru, Dash, and Mazumdar, NeurIPS 2020.
 Cardinality Constrained Multilinear Sets, with Dash and Rui Chen, ISCO 2020.
 On a generalization of the ChvatalGomory closure, with Dash and Dabeen Lee, IPCO 2020.
 Generalized Linear Rule Models, with Dash, Wei, and Gao, ICML 2019.
 Boolean Decision Rules via Column Generation, with Dash and Wei, NeurIPS 2018 (spotlight talk).
 Robusttodynamics linear programming, with Ahmadi, CDC 2015.

Robust confidentiality preserving data delivery in federated coalition networks, with Su, Gao, Ye, Liu, Berman, Calo, Abdelzaher, IFIP Networking 2014.

On Some Generalizations of the Split Closure, with Dash and Moran, IPCO 2013. 
A Model for Fusion and Code Motion in an Integrated AutoParallelizing Compiler, with Bondhugula, Dash, and Renganarayana, PACT 2010.

Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables, with Linderoth, IPCO 2008.

On a Generalization of the Master Cyclic Group Polyhedron, with Dash and Fukasawa, IPCO 2007.

On the MIR Closure of Polyhedra, with Dash and Lodi, IPCO 2007.

Valid Inequalities Based on Simple MixedInteger Sets, with Dash, IPCO 2004.

A New MinCut MaxFlow Ratio for Multicommodity Flows, IPCO 2002.
 Design Methodology for an Optical Mesh Network, with Klincewicz, ITCom 2002.
 A parallel branchandcut algorithm for capacitated network
design problems, Performance 1999.

Optimal Packing of Group Multicasting, Chen and Yener, Infocom 1998.
Workshop Papers Fair and Interpretable Decision Rules for Binary Classiﬁcation, with Connor Lawless, NeurIPS Workshop on Optimization for Machine Learning 2020.
 Multilabel prediction in log time and datadependent grouping, Multilabel prediction in log time and datadependent grouping, with Ubaru and Dash, NeurIPS Workshop on Information Theory and Machine Learning 2019
 LowRank Boolean Matrix Approximation by Integer Programming, with Hauser and Kovacs, NIPS Workshop on Optimization for Machine Learning 2017.
 Globally Optimal Symbolic Regression, with Austel, Dash, Horesh, Liberti, Nannicini and Schieber, NIPS Symposium on Interpretable Machine Learning 2017.
Conference Proceedings
 Combinatorial Optimization, Proceedings of ISCO 2020, with Baiou, Gendron, and Mahjoub, LNCS 12176, Springer 2020, ISBN 9783030532611.
 IPCO XV Proceedings, with Gerhard Woeginger, LNCS 6655, Springer 2011, ISBN 9783642208065.
Ph.D. ThesisShort BioOktay Gunluk is a professor of practice at Cornell University, School of ORIE. Before joining Cornell, he was the manager of the Mathematical Optimization and Algorithms group at IBM Research. He has also spent three years as a researcher in the Operations Research group in AT&T Labs. At both of these industrial labs, in addition to basic research in mathematical optimization, he has worked on various largescale applied optimization projects for internal and external customers.
Oktay Gunluk's main research interests are related to theoretical and computational aspects of discrete optimization problems, mainly in the area of integer programming. In particular, his main body of work is in the area of cutting planes for mixedinteger sets. Some of his recent work focuses on developing integer programming based approaches to classification problems in machine learning. He holds B.S. and M.S. degrees from Bogazici University and a Ph.D. degree from Columbia University. Contact: oktay.gunluk(at)cornell.edu

