Alper Atamtürk

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 40

Top Topics

Network Flow Problem

Quadratic Optimization

Top Venues

Oper. Res. Lett.

Publications

Linchuan Wei, Alper Atamtürk, Andrés Gómez, Simge Küçükyavuz
On the convex hull of convex quadratic optimization problems with indicators. Math. Program. 204 (1) (2024)
Alper Atamtürk, Andrés Gómez
Supermodularity and valid inequalities for quadratic optimization with indicators. Math. Program. 201 (1) (2023)
Shaoning Han, Andrés Gómez, Alper Atamtürk
$\mathbf {2\times 2}$-Convexifications for convex quadratic optimization with indicator variables. Math. Program. 202 (1) (2023)
Meng Li, Paul Grigas, Alper Atamtürk
On the softplus penalty for large-scale convex optimization. Oper. Res. Lett. 51 (6) (2023)
Alicia Y. Tsai, Juliette Decugis, Laurent El Ghaoui, Alper Atamtürk
State-driven Implicit Modeling for Sparsity and Robustness in Neural Networks. CoRR (2022)
Ramtin Madani, Mersedeh Ashraphijuo, Mohsen Kheirandishfard, Alper Atamtürk
Parabolic Relaxation for Quadratically-constrained Quadratic Programming - Part I: Definitions & Basic Properties. CoRR (2022)
Anna Deza, Alper Atamtürk
Regularization. CoRR (2022)
Alper Atamtürk, Vishnu Narayanan
Submodular function minimization and polarity. Math. Program. 196 (1) (2022)
Shaoning Han, Andrés Gómez, Alper Atamtürk
The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables. Oper. Res. Lett. 50 (2) (2022)
Linchuan Wei, Alper Atamtürk, Andrés Gómez, Simge Küçükyavuz
On the convex hull of convex quadratic optimization problems with indicators. CoRR (2022)
Anna Deza, Alper Atamtürk
Safe Screening for Logistic Regression with ℓ -ℓ Regularization. KDIR (2022)
Ramtin Madani, Mersedeh Ashraphijuo, Mohsen Kheirandishfard, Alper Atamtürk
Parabolic Relaxation for Quadratically-constrained Quadratic Programming - Part II: Theoretical & Computational Results. CoRR (2022)
Tuncay Altun, Ramtin Madani, Alper Atamtürk, Ross Baldick, Ali Davoudi
Enhanced Modeling of Contingency Response in Security-constrained Optimal Power Flow. CoRR (2021)
Alper Atamtürk, Andrés Gómez, Shaoning Han
Sparse and Smooth Signal Estimation: Convexification of L0-Formulations. J. Mach. Learn. Res. 22 (2021)
Alper Atamtürk, Carlos Deck, Hyemin Jeon
Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction. INFORMS J. Comput. 32 (2) (2020)
Alper Atamtürk, Andres Gomez
Safe screening rules for L0-regression from Perspective Relaxations. ICML (2020)
Alper Atamtürk, Andrés Gómez
Submodularity in Conic Quadratic Mixed 0-1 Optimization. Oper. Res. 68 (2) (2020)
Ramtin Madani, Mohsen Kheirandishfard, Javad Lavaei, Alper Atamtürk
Penalized semidefinite programming for quadratically-constrained quadratic optimization. J. Glob. Optim. 78 (3) (2020)
Alper Atamtürk, Andrés Gómez
-Regression. CoRR (2020)
Alper Atamtürk, Andres Gomez
Supermodularity and valid inequalities for quadratic optimization with indicators. CoRR (2020)
Alper Atamtürk, Hyemin Jeon
Lifted polymatroid inequalities for mean-risk optimization with indicator variables. J. Glob. Optim. 73 (4) (2019)
Alper Atamtürk, Vishnu Narayanan
Submodular Function Minimization and Polarity. CoRR (2019)
Alper Atamtürk, Andrés Gómez
Rank-one Convexification for Sparse Regression. CoRR (2019)
Alper Atamtürk, Andrés Gómez
Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra. Math. Program. Comput. 11 (2) (2019)
Alper Atamtürk, Andrés Gómez, Shaoning Han
Sparse and Smooth Signal Estimation: Convexification of L0 Formulations. CoRR (2018)
Alper Atamtürk, Avinash Bhardwaj
Network design with probabilistic capacities. Networks 71 (1) (2018)
Alper Atamtürk, Oktay Günlük
A note on capacity models for network design. Oper. Res. Lett. 46 (4) (2018)
Alper Sen, Alper Atamtürk, Philip M. Kaminsky
Technical Note - A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model. Oper. Res. 66 (4) (2018)
Alper Atamtürk, Andrés Gómez
Strong formulations for quadratic optimization with M-matrices and indicator variables. Math. Program. 170 (1) (2018)
Salar Fattahi, Javad Lavaei, Alper Atamtürk
Promises of conic relaxations in optimal transmission switching of power systems. CDC (2017)
Alper Atamtürk, Andrés Gómez
Maximizing a Class of Utility Functions Over the Vertices of a Polytope. Oper. Res. 65 (2) (2017)
Alper Atamtürk, Simge Küçükyavuz, Birce Tezel
Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem. SIAM J. Optim. 27 (3) (2017)
Alper Atamtürk, Birce Tezel, Simge Küçükyavuz
Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem. CoRR (2017)
Ramtin Madani, Javad Lavaei, Ross Baldick, Alper Atamtürk
Power System State Estimation and Bad Data Detection by Means of Conic Relaxation. HICSS (2017)
Alper Atamtürk, Sam Burer
Editorial. Discret. Optim. 24 (2017)
Chen Chen, Alper Atamtürk, Shmuel S. Oren
A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables. Math. Program. 165 (2) (2017)
Alper Atamtürk, Andrés Gómez, Simge Küçükyavuz
Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems. Networks 67 (4) (2016)
Morteza Ashraphijuo, Salar Fattahi, Javad Lavaei, Alper Atamtürk
A strong semidefinite programming relaxation of the unit commitment problem. CDC (2016)
Pelin Damci-Kurt, Simge Küçükyavuz, Deepak Rajan, Alper Atamtürk
A polyhedral study of production ramping. Math. Program. 158 (1-2) (2016)
Alper Atamtürk, Avinash Bhardwaj
Supermodular covering knapsack polytope. Discret. Optim. 18 (2015)
Animesh Garg, Timmy Siauw, Guang Yang, Sachin Patil, J. Adam M. Cunha, I-Chow Hsu, Jean Pouliot, Alper Atamtürk, Kenneth Y. Goldberg
Exact reachability analysis for planning skew-line needle arrangements for automated brachytherapy. CASE (2014)
M. Selim Aktürk, Alper Atamtürk, Sinan Gürel
Aircraft Rescheduling with Cruise Speed Control. Oper. Res. 62 (4) (2014)
Alper Atamtürk, Laurent Flindt Muller, David Pisinger
Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds. INFORMS J. Comput. 25 (3) (2013)
Alper Atamtürk, Kiavash Kianfar
n-step mingling inequalities: new facets for the mixed-integer knapsack set. Math. Program. 132 (1-2) (2012)
Alper Atamtürk, Gemma Berenguer, Zuo-Jun Max Shen
A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems. Oper. Res. 60 (2) (2012)
Alper Atamtürk, Vishnu Narayanan
Lifting for conic mixed-integer programming. Math. Program. 126 (2) (2011)
Shabbir Ahmed, Alper Atamtürk
Maximizing a class of submodular utility functions. Math. Program. 128 (1-2) (2011)
Alper Atamtürk, Vishnu Narayanan
Conic mixed-integer rounding cuts. Math. Program. 122 (1) (2010)
M. Selim Aktürk, Alper Atamtürk, Sinan Gürel
Parallel machine match-up scheduling with manufacturing cost considerations. J. Sched. 13 (1) (2010)
Alper Atamtürk, Oktay Günlük
Mingling: mixed-integer rounding with bounds. Math. Program. 123 (2) (2010)
M. Selim Akturk, Alper Atamtürk, Sinan Gurel
A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Oper. Res. Lett. 37 (3) (2009)
Alper Atamtürk, Vishnu Narayanan
The submodular knapsack polytope. Discret. Optim. 6 (4) (2009)
Alper Atamtürk, Muhong Zhang
The Flow Set with Partial Order. Math. Oper. Res. 33 (3) (2008)
Alper Atamtürk, Vishnu Narayanan
Polymatroids and mean-risk minimization in discrete optimization. Oper. Res. Lett. 36 (5) (2008)
Alper Atamtürk, Deepak Rajan
Partition inequalities for capacitated survivable network design based on directed p-cycles. Discret. Optim. 5 (2) (2008)
Alper Atamtürk, Simge Küçükyavuz
) algorithm for lot sizing with inventory bounds and fixed costs. Oper. Res. Lett. 36 (3) (2008)
Alper Atamtürk, Vishnu Narayanan
Cuts for Conic Mixed-Integer Programming. IPCO (2007)
Alper Atamtürk, Muhong Zhang
Two-Stage Robust Network Flow and Design Under Demand Uncertainty. Oper. Res. 55 (4) (2007)
Alper Atamtürk, Oktay Günlük
Network design arc set with variable upper bounds. Networks 50 (1) (2007)
Alper Atamtürk
Strong Formulations of Robust Mixed 0-1 Programming. Math. Program. 108 (2-3) (2006)
Alper Atamtürk, Martin W. P. Savelsbergh
Integer-Programming Software Systems. Ann. Oper. Res. 140 (1) (2005)
Alper Atamtürk, Simge Küçükyavuz
Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation. Oper. Res. 53 (4) (2005)
Alper Atamtürk
Cover and Pack Inequalities for (Mixed) Integer Programming. Ann. Oper. Res. 139 (1) (2005)
Alper Atamtürk
Sequence Independent Lifting for Mixed-Integer Programming. Oper. Res. 52 (3) (2004)
Alper Atamtürk, Juan Carlos Muñoz
A study of the lot-sizing polytope. Math. Program. 99 (3) (2004)
Deepak Rajan, Alper Atamtürk
A directed cycle-based column-and-cut generation method for capacitated survivable network design. Networks 43 (4) (2004)
Alper Atamtürk
On the facets of the mixed-integer knapsack polyhedron. Math. Program. 98 (1-3) (2003)
Alper Atamtürk
On capacitated network design cut-set polyhedra. Math. Program. 92 (3) (2002)
Alper Atamtürk, Deepak Rajan
On splittable and unsplittable flow capacitated network design arc-set polyhedra. Math. Program. 92 (2) (2002)
Alper Atamtürk
Flow pack facets of the single node fixed-charge flow polytope. Oper. Res. Lett. 29 (3) (2001)
Alper Atamtürk, Dorit S. Hochbaum
Capacity Acquisition, Subcontracting, and Lot Sizing. Manag. Sci. 47 (8) (2001)
Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh
Valid inequalities for problems with additive variable upper bounds. Math. Program. 91 (1) (2001)
Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh
Conflict graphs in solving integer programming problems. Eur. J. Oper. Res. 121 (1) (2000)
Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh
The mixed vertex packing problem. Math. Program. 89 (1) (2000)
Alper Atamtürk, Ellis L. Johnson, Jeff T. Linderoth, Martin W. P. Savelsbergh
A Relational Modeling System for Linear and Integer Programming. Oper. Res. 48 (6) (2000)
Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh
Valid Inequalities for Problems with Additive Variable Upper Bounds. IPCO (1999)
Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems. J. Heuristics 1 (2) (1996)