49 citations · 107 across the 19 of their papers we have counts for
10 papers · 1 filter
A Bound Strengthening Method for Optimal Transmission Switching in Power Systems
Salar Fattahi, Javad Lavaei, Alper Atamturk
This paper studies the optimal transmission switching (OTS) problem for power systems, where certain lines are fixed (uncontrollable) and the remaining ones are controllable via on…
Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction
Alper Atamturk, Carlos Deck, Hyemin Jeon
The advances in conic optimization have led to its increased utilization for modeling data uncertainty. In particular, conic mean-risk optimization gained prominence in probabilist…
Multi-Commodity Multi-Facility Network Design
Alper Atamturk, Oktay Gunluk
We consider multi-commodity network design models, where capacity can be added to the arcs of the network using multiples of facilities that may have different capacities. This cla…
Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
Alper Atamturk, Andres Gomez
We consider minimizing a conic quadratic objective over a polyhedron. Such problems arise in parametric value-at-risk minimization, portfolio optimization, and robust optimization…
A Spatial Branch-and-Cut Method for Nonconvex QCQP with Bounded Complex Variables
Chen Chen, Alper Atamturk, Shmuel S. Oren
We develop a spatial branch-and-cut approach for nonconvex Quadratically Constrained Quadratic Programs with bounded complex variables (CQCQP). Linear valid inequalities are added…
Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem
Alper Atamturk, Birce Tezel, Simge Kucukyavuz
Capacitated fixed-charge network flows are used to model a variety of problems in telecommunication, facility location, production planning and supply chain management. In this pap…
A Conic Integer Programming Approach to Constrained Assortment Optimization under the Mixed Multinomial Logit Model
Alper Sen, Alper Atamturk, Philip Kaminsky
We consider the constrained assortment optimization problem under the mixed multinomial logit model. Even moderately sized instances of this problem are challenging to solve direct…
Submodularity in conic quadratic mixed 0-1 optimization
Alper Atamturk, Andres Gomez
We describe strong convex valid inequalities for conic quadratic mixed 0-1 optimization. These inequalities can be utilized for solving numerous practical nonlinear discrete optimi…
Network Design with Probabilistic Capacities
Alper Atamturk, Avinash Bhardwaj
We consider a network design problem with random arc capacities and give a formulation with a probabilistic capacity constraint on each cut of the network. To handle the exponentia…
Lifted Polymatroid Inequalities for Mean-Risk Optimization with Indicator Variables
Alper Atamturk, Hyemin Jeon
We investigate a mixed 0-1 conic quadratic optimization problem with indicator variables arising in mean-risk optimization. The indicator variables are often used to model non-conv…