# Alper Atamtürk

According to our database

Collaborative distances:

^{1}, Alper Atamtürk authored at least 59 papers between 1996 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Penalized semidefinite programming for quadratically-constrained quadratic optimization.

J. Glob. Optim., 2020

Oper. Res., 2020

Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction.

INFORMS J. Comput., 2020

CoRR, 2020

2019

Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra.

Math. Program. Comput., 2019

Lifted polymatroid inequalities for mean-risk optimization with indicator variables.

J. Glob. Optim., 2019

CoRR, 2019

CoRR, 2019

2018

Oper. Res. Lett., 2018

Networks, 2018

Strong formulations for quadratic optimization with M-matrices and indicator variables.

Math. Program., 2018

Technical Note - A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model.

Oper. Res., 2018

CoRR, 2018

2017

Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem.

SIAM J. Optim., 2017

A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables.

Math. Program., 2017

Oper. Res., 2017

Discret. Optim., 2017

Power System State Estimation and Bad Data Detection by Means of Conic Relaxation.

Proceedings of the 50th Hawaii International Conference on System Sciences, 2017

Proceedings of the 56th IEEE Annual Conference on Decision and Control, 2017

2016

Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems.

Networks, 2016

Math. Program., 2016

Proceedings of the 55th IEEE Conference on Decision and Control, 2016

2015

Discret. Optim., 2015

2014

Oper. Res., 2014

Exact reachability analysis for planning skew-line needle arrangements for automated brachytherapy.

Proceedings of the 2014 IEEE International Conference on Automation Science and Engineering, 2014

2013

Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds.

INFORMS J. Comput., 2013

2012

Math. Program., 2012

A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems.

Oper. Res., 2012

2011

Math. Program., 2011

Math. Program., 2011

2010

J. Sched., 2010

Math. Program., 2010

Math. Program., 2010

2009

A strong conic quadratic reformulation for machine-job assignment with controllable processing times.

Oper. Res. Lett., 2009

Discret. Optim., 2009

2008

Oper. Res. Lett., 2008

An O(n<sup>2</sup>) algorithm for lot sizing with inventory bounds and fixed costs.

Oper. Res. Lett., 2008

Math. Oper. Res., 2008

Partition inequalities for capacitated survivable network design based on directed p-cycles.

Discret. Optim., 2008

2007

Networks, 2007

Oper. Res., 2007

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

Math. Program., 2006

2005

Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation.

Oper. Res., 2005

Ann. Oper. Res., 2005

Ann. Oper. Res., 2005

2004

A directed cycle-based column-and-cut generation method for capacitated survivable network design.

Networks, 2004

Math. Program., 2004

Oper. Res., 2004

2003

Math. Program., 2003

2002

Math. Program., 2002

Math. Program., 2002

2001

Oper. Res. Lett., 2001

Math. Program., 2001

Manag. Sci., 2001

2000

Math. Program., 2000

Oper. Res., 2000

Eur. J. Oper. Res., 2000

1996

A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems.

J. Heuristics, 1996