Alper Atamtürk

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