A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems. - Alper Atamtürk; George L. Nemhauser; Martin W. P. Savelsbergh (J. Heuristics, 1996)

Conflict graphs in solving integer programming problems. - Alper Atamtürk; George L. Nemhauser; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2000)

A Relational Modeling System for Linear and Integer Programming. - Alper Atamtürk; Ellis L. Johnson; Jeff T. Linderoth; Martin W. P. Savelsbergh (Oper. Res., 2000)

The mixed vertex packing problem. - Alper Atamtürk; George L. Nemhauser; Martin W. P. Savelsbergh (Math. Program., 2000)

Capacity Acquisition, Subcontracting, and Lot Sizing. - Alper Atamtürk; Dorit S. Hochbaum (Manag. Sci., 2001)

Valid inequalities for problems with additive variable upper bounds. - Alper Atamtürk; George L. Nemhauser; Martin W. P. Savelsbergh (Math. Program., 2001)

Flow pack facets of the single node fixed-charge flow polytope. - Alper Atamtürk (Oper. Res. Lett., 2001)

On capacitated network design cut-set polyhedra. - Alper Atamtürk (Math. Program., 2002)

On splittable and unsplittable flow capacitated network design arc-set polyhedra. - Alper Atamtürk; Deepak Rajan (Math. Program., 2002)

On the facets of the mixed-integer knapsack polyhedron. - Alper Atamtürk (Math. Program., 2003)

Sequence Independent Lifting for Mixed-Integer Programming. - Alper Atamtürk (Oper. Res., 2004)

A study of the lot-sizing polytope. - Alper Atamtürk; Juan Carlos Muñoz (Math. Program., 2004)

A directed cycle-based column-and-cut generation method for capacitated survivable network design. - Deepak Rajan; Alper Atamtürk (Networks, 2004)

Cover and Pack Inequalities for (Mixed) Integer Programming. - Alper Atamtürk (Ann. Oper. Res., 2005)

Integer-Programming Software Systems. - Alper Atamtürk; Martin W. P. Savelsbergh (Ann. Oper. Res., 2005)

Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation. - Alper Atamtürk; Simge Küçükyavuz (Oper. Res., 2005)

Strong Formulations of Robust Mixed 0-1 Programming. - Alper Atamtürk (Math. Program., 2006)

Cuts for Conic Mixed-Integer Programming. - Alper Atamtürk; Vishnu Narayanan (IPCO, 2007)

Two-Stage Robust Network Flow and Design Under Demand Uncertainty. - Alper Atamtürk; Muhong Zhang (Oper. Res., 2007)

Network design arc set with variable upper bounds. - Alper Atamtürk; Oktay Günlük (Networks, 2007)

Partition inequalities for capacitated survivable network design based on directed p-cycles. - Alper Atamtürk; Deepak Rajan (Discret. Optim., 2008)

The Flow Set with Partial Order. - Alper Atamtürk; Muhong Zhang (Math. Oper. Res., 2008)

An O(n2) algorithm for lot sizing with inventory bounds and fixed costs. - Alper Atamtürk; Simge Küçükyavuz (Oper. Res. Lett., 2008)

Polymatroids and mean-risk minimization in discrete optimization. - Alper Atamtürk; Vishnu Narayanan (Oper. Res. Lett., 2008)

The submodular knapsack polytope. - Alper Atamtürk; Vishnu Narayanan (Discret. Optim., 2009)

A strong conic quadratic reformulation for machine-job assignment with controllable processing times. - M. Selim Akturk; Alper Atamtürk; Sinan Gurel (Oper. Res. Lett., 2009)

Mingling: mixed-integer rounding with bounds. - Alper Atamtürk; Oktay Günlük (Math. Program., 2010)

Conic mixed-integer rounding cuts. - Alper Atamtürk; Vishnu Narayanan (Math. Program., 2010)

Parallel machine match-up scheduling with manufacturing cost considerations. - M. Selim Aktürk; Alper Atamtürk; Sinan Gürel (J. Sched., 2010)

Maximizing a class of submodular utility functions. - Shabbir Ahmed 001; Alper Atamtürk (Math. Program., 2011)

Lifting for conic mixed-integer programming. - Alper Atamtürk; Vishnu Narayanan (Math. Program., 2011)

A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems. - Alper Atamtürk; Gemma Berenguer; Zuo-Jun Max Shen (Oper. Res., 2012)

n-step mingling inequalities: new facets for the mixed-integer knapsack set. - Alper Atamtürk; Kiavash Kianfar (Math. Program., 2012)

Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds. - Alper Atamtürk; Laurent Flindt Muller; David Pisinger (INFORMS J. Comput., 2013)

Exact reachability analysis for planning skew-line needle arrangements for automated brachytherapy. - Animesh Garg; Timmy Siauw; Guang Yang; Sachin Patil; J. Adam M. Cunha; I-Chow Hsu; Jean Pouliot; Alper Atamtürk; Kenneth Y. Goldberg (CASE, 2014)

Aircraft Rescheduling with Cruise Speed Control. - M. Selim Aktürk; Alper Atamtürk; Sinan Gürel (Oper. Res., 2014)

Supermodular covering knapsack polytope. - Alper Atamtürk; Avinash Bhardwaj (Discret. Optim., 2015)

A strong semidefinite programming relaxation of the unit commitment problem. - Morteza Ashraphijuo; Salar Fattahi; Javad Lavaei; Alper Atamtürk (CDC, 2016)

A polyhedral study of production ramping. - Pelin Damci-Kurt; Simge Küçükyavuz; Deepak Rajan; Alper Atamtürk (Math. Program., 2016)

Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems. - Alper Atamtürk; Andrés Gómez 001; Simge Küçükyavuz (Networks, 2016)

Promises of conic relaxations in optimal transmission switching of power systems. - Salar Fattahi; Javad Lavaei; Alper Atamtürk (CDC, 2017)

Power System State Estimation and Bad Data Detection by Means of Conic Relaxation. - Ramtin Madani; Javad Lavaei; Ross Baldick; Alper Atamtürk (HICSS, 2017)

Editorial. - Alper Atamtürk; Sam Burer (Discret. Optim., 2017)

Maximizing a Class of Utility Functions Over the Vertices of a Polytope. - Alper Atamtürk; Andrés Gómez 001 (Oper. Res., 2017)

A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables. - Chen Chen 026; Alper Atamtürk; Shmuel S. Oren (Math. Program., 2017)

Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem. - Alper Atamtürk; Simge Küçükyavuz; Birce Tezel (SIAM J. Optim., 2017)

Technical Note - A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model. - Alper Sen 002; Alper Atamtürk; Philip M. Kaminsky (Oper. Res., 2018)

Strong formulations for quadratic optimization with M-matrices and indicator variables. - Alper Atamtürk; Andrés Gómez 001 (Math. Program., 2018)

Network design with probabilistic capacities. - Alper Atamtürk; Avinash Bhardwaj (Networks, 2018)

A note on capacity models for network design. - Alper Atamtürk; Oktay Günlük (Oper. Res. Lett., 2018)

Rank-one Convexification for Sparse Regression. - Alper Atamtürk; Andrés Gómez 001 (CoRR, 2019)

Lifted polymatroid inequalities for mean-risk optimization with indicator variables. - Alper Atamtürk; Hyemin Jeon (J. Glob. Optim., 2019)

Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra. - Alper Atamtürk; Andrés Gómez 001 (Math. Program. Comput., 2019)

Safe screening rules for L0-regression from Perspective Relaxations. - Alper Atamtürk; Andrés Gómez 001 (ICML, 2020)

Safe Screening Rules for 𝓁0-Regression. - Alper Atamtürk; Andrés Gómez 001 (CoRR, 2020)

Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction. - Alper Atamtürk; Carlos Deck; Hyemin Jeon (INFORMS J. Comput., 2020)

Submodularity in Conic Quadratic Mixed 0-1 Optimization. - Alper Atamtürk; Andrés Gómez 001 (Oper. Res., 2020)

Penalized semidefinite programming for quadratically-constrained quadratic optimization. - Ramtin Madani; Mohsen Kheirandishfard; Javad Lavaei; Alper Atamtürk (J. Glob. Optim., 2020)

Enhanced Modeling of Contingency Response in Security-constrained Optimal Power Flow. - Tuncay Altun; Ramtin Madani; Alper Atamtürk; Ross Baldick; Ali Davoudi (CoRR, 2021)

Sparse and Smooth Signal Estimation: Convexification of L0-Formulations. - Alper Atamtürk; Andrés Gómez 001; Shaoning Han (J. Mach. Learn. Res., 2021)

Safe Screening for Logistic Regression with ℓ -ℓ Regularization. - Anna Deza; Alper Atamtürk (KDIR, 2022)

Safe Screening for Logistic Regression with 𝓁0-𝓁2 Regularization. - Anna Deza; Alper Atamtürk (CoRR, 2022)

Parabolic Relaxation for Quadratically-constrained Quadratic Programming - Part I: Definitions & Basic Properties. - Ramtin Madani; Mersedeh Ashraphijuo; Mohsen Kheirandishfard; Alper Atamtürk (CoRR, 2022)

Parabolic Relaxation for Quadratically-constrained Quadratic Programming - Part II: Theoretical & Computational Results. - Ramtin Madani; Mersedeh Ashraphijuo; Mohsen Kheirandishfard; Alper Atamtürk (CoRR, 2022)

State-driven Implicit Modeling for Sparsity and Robustness in Neural Networks. - Alicia Y. Tsai; Juliette Decugis; Laurent El Ghaoui; Alper Atamtürk (CoRR, 2022)

Submodular function minimization and polarity. - Alper Atamtürk; Vishnu Narayanan (Math. Program., 2022)

The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables. - Shaoning Han; Andrés Gómez 001; Alper Atamtürk (Oper. Res. Lett., 2022)

Supermodularity and valid inequalities for quadratic optimization with indicators. - Alper Atamtürk; Andrés Gómez 001 (Math. Program., 2023)

$ mathbf {2 times 2}$-Convexifications for convex quadratic optimization with indicator variables. - Shaoning Han; Andrés Gómez 001; Alper Atamtürk (Math. Program., 2023)

On the softplus penalty for large-scale convex optimization. - Meng Li; Paul Grigas; Alper Atamtürk (Oper. Res. Lett., 2023)

Fair and Accurate Regression: Strong Formulations and Algorithms. - Anna Deza; Andrés Gómez; Alper Atamtürk (CoRR, 2024)

On the convex hull of convex quadratic optimization problems with indicators. - Linchuan Wei; Alper Atamtürk; Andrés Gómez 001; Simge Küçükyavuz (Math. Program., 2024)

New Penalized Stochastic Gradient Methods for Linearly Constrained Strongly Convex Optimization. - Meng Li; Paul Grigas; Alper Atamtürk (J. Optim. Theory Appl., 2025)