Focus:
My field of expertise is operations research. In particular, I am interested in:
· Algorithms for discrete optimization
· Linear and integer programming
· Network flows
· Network interdiction
· Timetabling
· Transportation Logistics
· Very large-scale neighborhood search
Papers:
D. S. Altner, R. K. Ahuja, Ö. Ergun, and J. B. Orlin, Very Large-Scale Neighborhood Search, in preparation for Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, second edition, E. K. Burke and G. Kendall (eds.), Springer, 2010.
D. S. Altner, R. K. Ahuja, Ö. Ergun, and J. B. Orlin, Very Large-Scale Neighborhood Search, to appear in Wiley Encyclopedia of Operations Research and Management Science, J. J. Cochran (ed.), Wiley, 2010.
D. S. Altner, R. K. Ahuja, Ö. Ergun, J. B. Orlin and A. Punnen, Very Large-Scale Neighborhood Search, to appear in Handbook of Discrete and Combinatorial Mathematics, second edition, K. Rosen (ed.), CRC Press, 2009.
D. S. Altner, Ö. Ergun and N. A. Uhan, The Maximum Flow Network Interdiction Problem: Valid Inequalities, Integrality Gaps and Approximability, submitted, 2009. Download.
D. S. Altner and Ö. Ergun, Rapidly Computing a Robust Minimum Capacity s-t Cut: A Case Study in Solving a Sequence of Maximum Flow Problems, under revision, 2008.
D. S. Altner and Ö. Ergun, Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR) 2008, L. Perron and M. A. Trick (eds.), Lecture Notes in Computer Science 5015, pp. 283-288, Springer, 2008. Abstract.
D. S. Altner, Advancements on Problems Involving Maximum Flows, Ph.D. Thesis, H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, 2008.