Alper Atamturk

Associate Professor

Ph.D. Georgia Institute of Technology, 1998
Industrial and Systems Engineering

4175 Etcheverry Hall
(510) 642-4559
E-mail: atamturkieor.berkeley.edu

Personal Webpage:
http://www.ieor.berkeley.edu/~atamturk

"We are in an exciting era where a series of mathematical discoveries and algorithmic innovations, coupled with the advances in computer technology, make it possible to solve large-scale practical optimization problems in a variety of areas, ranging from fleet logistics to electronic financial/commodity exchanges, from telecommunications network design to genetics."

Alper Atamturk is an associate professor in the Department 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, computational optimization, robust optimization, logistics of production, distribution, transportation, telecommunication systems. He serves on the editorial boards of Operations Research, Management Science, and Networks.

Research
  • Computational Optimization
  • Integer Programming
  • Logistics of Production, Distribution, Transportation, Telecommunication Systems
  • Network Design
Publications
  • "Lot Sizing with Inventory Bounds and Fixed Charges," (with S. Kucukyavuz) to appear in Operations Research.
  • "Cover and Pack Inequalities for (Mixed) Integer Programming,"to appear in Annals of Operations Research.
  • "Integer Programming Software Systems," (with M.W.P. Savelsbergh)to appear in Annals of Operations Research.
  • "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.
  • "Survivable Network Design: Simultaneous Routing of Flows and Slacks"(with D. Rajan), Telecommunications Network Design and Management, G. Anandalingam and S. Raghavan (eds.), Kluwer, 65-82, 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 UpperBounds" (with G.L. Nemhauser and M.W.P. Savelsbergh), Mathematical Programming 91, 145-162, 2001.
  • "The Mixed Vertex Packing Problem" (with G.L. Nemhauser andM.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" (withG.L. Nemhauser and M.W.P. Savelsbergh), European Journal ofOperational Research 121, 40-55, 2000.
  • "A Combined Lagrangian, Linear Programming and Implication Heuristicfor Large-Scale Set Partitioning Problems" (with G.L. Nemhauser andM.W.P. Savelsbergh), Journal of Heuristics 1, 247-259,1996.
Ph.D. Theses Supervised
  • "Polyhedral Approaches to Capacitated Fixed-Charge Network Flow Problems," Simge Kucukyavuz, 2004.
  • "Designing Survivable Capacitated Networks: Polyhedral Analysis and Algorithms," Deepak Rajan, 2004.