Alper Atamturk

423 Sutardja Dai Hall
(510) 642-4559
E-mail: atamturk(at)berkeley.edu
Personal Webpage:
https://atamturk.ieor.berkeley.edu/
Berkeley Computational Optimization Lab:
http://bcol.ieor.berkeley.edu

Alper Atamturk is a Professor of Industrial Engineering and Operations Research at the University of California, Berkeley. He received his Ph.D. from the Georgia Institute of Technology in 1998. His current research interests are in integer programming (conic, mixed, combinatorial), optimization under uncertainty with applications to power systems, portfolio/network design, logistics of production, distribution, transportation systems and treatments for cancer. He serves on the editorial boards of Operations Research, Mathematical Programming Computation, Discrete Optimization, Journal of Risk, and Networks; and has in the past served on the editorial board of Management Science. Dr. Atamturk is a National Security Science & Engineering Faculty Fellow of the US Department of Defense.

• Integer Optimization (Conic, Mixed, Combinatorial)
• Optimization under Uncertainty
• Power Systems
• Logistics of Production, Distribution, Transportation, Telecommunication Systems
• Portfolio/Network Design
• Treatments for Cancer

Major Publications (complete list with PDF files at http://coeieor.wpengine.com/~atamturk/pubs/papers.xml)

• "Path Cover and Path Pack Inequalities for Capacitated Fixed-Charge Network Flow Problems" (with B. Tezel and S. Kucukyavuz), Forthcoming in SIAM J on Optimization.
• "A Spatial Branch-and-Cut Algorithm for Nonconvex QCQP with Bounded Complex Variables" (with C. Chen and S. Oren), Forthcoming in Mathematical Programming.
• "Maximizing a Class of Utility Functions over the Vertices of a Polytope" (with A. Gomez) Operations Research 65, 433-445, 2017.
• "Conic Relaxations of the Unit Commitment Problem" (with S. Fattahi, M. Ashraphijuo, and J. Lavaei) Energy, 134, 1079-1095, 2017.
• "A Polyhedral Study of Production Ramping" (with Pelin Damci, Simge Kucukyavuz, and Deepak Rajan) Mathematical Programming 158, 175-205, 2016.
• "Three-partition Inequalities for Constant Capacity Fixed-Charge Network Flow Problems" (with A. Gomez and S. Kucukyavuz) Networks 67, 299-315, 2016.
• "The Submodular Knapsack Polytope" (with V. Narayanan) Discrete Optimization18, 74-86, 2015.
• "Bound Tightening for Alternating Current Optimal Power Flow Instances with Duality Gap" (with C. Chen and S. S. Oren) IEEE Transactions on Power Systems 31, 3729-3736, 2015.
• "Aircraft Rescheduling with Cruise Speed Control" (with S. Akturk and S. Gurel) Operations Research 62, 829-845, 2014.
• "Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds" (with L. F. Muller and D. Pisinger) INFORMS Journal on Computing 25, 420-431, 2013.
• "A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems" (with G. Berenguer and Z.-J. M. Shen) Operations Research 60, 366-381, 2012.
• "N-step Mingling Inequalities: Facets for Mixed-Integer Knapsack Sets" (with K. Kianfar) Mathematical Programming 132, 79-98, 2012.
• "NPIP: A Skew Line Needle Configuration Optimization System for HDR Brachytherapy" (with T. Siauw, A. Cunha, D. Berenson, I.-C. Hsu, J. Pouliot, K. Goldberg) Medical Physics 39, 4339-4346, 2012.
• "Maximizing a Class of Submodular Utility Functions" (with S. Ahmed) Mathematical Programming 126, 351-363, 2011.
• "Lifting for Conic Mixed-Integer Programming" (with V. Narayanan) Mathematical Programming 126, 351-363, 2011.
• "IPIP: A New Approach to Inverse Planning for HDR Brachytherapy by Directly Optimizing Dosimetric Indices" (with T. Siauw, A. Cunha, I.-C. Hsu, J. Pouliot, K. Goldberg) Medical Physics 38, 4045-4051, 2011.
• "Parallel Match-Up Scheduling with Manufacturing Cost Considerations" (with M. S. Akturk and S. Gurel)  Journal of Scheduling 13, 95-110, 2010.
• "Mingling: Mixed-Integer Rounding with Bounds" (with O. Gunluk) Mathematical Programming 123, 315-338, 2010.
• "Conic Mixed-Integer Rounding Cuts" (with V. Narayanan) Mathematical Programming 122, 1-20, 2010.
• "A Strong Conic Quadratic Reformulation for Machine-Job Assignment with Controllable Processing Times" (with M. S. Akturk and S. Gurel) Operations Research Letters 37, 187-191, 2009.
• "The Flow Set with Partial Order" (with M. Zhang) Mathematics of Operations Research 33, 630-746, 2008.
• "Polymatroids and Mean-Risk Minimization in Discrete Optimization" Operations Research Letters 36, 618-622, 2008.
• "Two-Stage Robust Network Flow and Design Under Demand Uncertainty" (with M. Zhang) Operations Research 55, 662-673, 2007.
• "Strong Formulations of Robust Mixed 0-1 Programming" Mathematical Programming 108, 235-250, 2006.
• "Lot Sizing with Inventory Bounds and Fixed Charges" (with S. Kucukyavuz) Operations Research 53, 711-730, 2005.
• "Cover and Pack Inequalities for (Mixed) Integer Programming" Annals of Operations Research 139, 21-38, 2005.
• "Integer Programming Software Systems" (with M.W.P. Savelsbergh) Annals of Operations Research 140, 67-124, 2005.
• "A Study of the Lot-Sizing Polytope" (with J.C. Munoz) Mathematical Programming 99, 443-465, 2004.
• "A Directed Cycle based Column-and-Cut Generation Method for Capacitated Survivable Network Design" (with D.Rajan) Networks 43, 201-211, 2004.
• "Sequence Independent Lifting for Mixed-Integer Programming" Operations Research 52, 487-490, 2004.
• "On the Facets of the Mixed-Integer Knapsack Polyhedron" Mathematical Programming 98, 145-175, 2003.
• "Deferred Item and Vehicle Routing within Integrated Networks" (with K.R. Smilowitz and C.F. Daganzo) Transportation Research: Logistics and Transportation 39, 305-323, 2003.
• "On Capacitated Network Design Cut-Set Polyhedra" Mathematical Programming 92, 425-437, 2002.
• "On Splittable and Unsplittable Capacitated Network Design Arc-Set Polyhedra" (with D. Rajan) Mathematical Programming 92, 315-333, 2002.
• "Flow Pack Facets of the Single Node Fixed-Charge Flow Polytope" Operations Research Letters 29, 107-114, 2001.
• "Capacity Acquisition, Subcontracting, and Lot Sizing" (with D.S. Hochbaum) Management Science 47, 1081-1100, 2001.
• "Valid Inequalities for Problems with Additive Variable Upper Bounds" (with G.L. Nemhauser and M.W.P. Savelsbergh) Mathematical Programming 91, 145-162, 2001.
• "The Mixed Vertex Packing Problem" (with G.L. Nemhauser and M.W.P. Savelsbergh) Mathematical Programming 89, 35-53, 2000.
• "A Relational Modeling System for Linear and Integer Programming" (with E.L. Johnson, J.T. Linderoth and M.W.P. Savelsbergh) Operations Research 48, 846-857, 2000.
• "Conflict Graphs in Solving Integer Programming Problems" (with G.L. Nemhauser and M.W.P. Savelsbergh) European Journal of Operational Research 121, 40-55, 2000.

• "Polyhedral Approaches to Capacitated Fixed-Charge Network Flow Problems," Simge Kucukyavuz, 2004.
• "Designing Survivable Capacitated Networks: Polyhedral Analysis and Algorithms," Deepak Rajan, 2004.
• "Robust Network Design and Knapsack Polyhedra," Muhong Zhang, 2006.
• "Branch-and-Cut Algorithms for Conic Mixed-Integer Programming," Vishnu Narayanan, 2008.
• "Branch-and-Cut Algorithms for Nonlinear Power Systems Problems," Chen Chen, 2015.
• "Binary Conic Quadratic Knapsacks," Avinash Bhardwaj, 2015
• "Optimization & Design for Automation of Brachytherapy Delivery & Learning Robot-Assisted Surgical Sub-Tasks," Animesh Garg, 2016