Doctor of Philosophy with a Major in Algorithms, Combinatorics, and Optimization

One of the most rapidly growing areas of research in applied mathematics, computer science, and operations research has been dealing with discrete structures. This has been most evident in the fields of combinatorics, discrete optimization, and the analysis of algorithms. Increasingly, work in each of these subjects has come to depend on knowledge of all of them. Indeed, many of the most significant advances have resulted from the efforts of researchers in more than one, if not all three, of these areas.

In response to these developments, Georgia Tech has introduced a doctoral degree program in Algorithms, Combinatorics, and Optimization (ACO). This multidisciplinary program is sponsored jointly by the School of Mathematics, the School of Industrial and Systems Engineering, and the College of Computing. Faculty for the program are drawn from these three sponsoring units, as well as from the School of Electrical and Computer Engineering and the College of Business.

The ACO program is arranged to bring together the study of discrete structures and the design and analysis of algorithms in areas such as graph theory, integer programming, combinatorial optimization, and polyhedral theory. It is intended for students possessing a strong background in one or more of the fields represented by the three sponsoring units. Each student in the program has a single home department chosen from the School of Mathematics, the School of Industrial and Systems Engineering, and the College of Computing. Courses for the program are drawn from all three of these units, and include study in such areas as combinatorial methods, algebraic structures, probability, the analysis of algorithms, computational complexity, linear programming, discrete optimization, and convex analysis.