According to our database1, Alper Atamtürk authored at least 59 papers between 1996 and 2020.
Legend:Book In proceedings Article PhD thesis Other
Penalized semidefinite programming for quadratically-constrained quadratic optimization.
J. Glob. Optim., 2020
Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction.
INFORMS J. Comput., 2020
Math. Program. Comput., 2019
J. Glob. Optim., 2019
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
Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem.
SIAM J. Optim., 2017
Math. Program., 2017
Oper. Res., 2017
Proceedings of the 50th Hawaii International Conference on System Sciences, 2017
Proceedings of the 56th IEEE Annual Conference on Decision and Control, 2017
Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems.
Proceedings of the 55th IEEE Conference on Decision and Control, 2016
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
Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds.
INFORMS J. Comput., 2013
Math. Program., 2012
A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems.
Oper. Res., 2012
J. Sched., 2010
A strong conic quadratic reformulation for machine-job assignment with controllable processing times.
Oper. Res. Lett., 2009
Oper. Res. Lett., 2008
Oper. Res. Lett., 2008
Partition inequalities for capacitated survivable network design based on directed p-cycles.
Discret. Optim., 2008
Proceedings of the Integer Programming and Combinatorial Optimization, 2007
Oper. Res., 2005
A directed cycle-based column-and-cut generation method for capacitated survivable network design.
Math. Program., 2002
Oper. Res. Lett., 2001
Math. Program., 2001
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems.
J. Heuristics, 1996