Phd algorithms combinatorics and optimization in Georgia institute of technology
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.
Academic degrees and records,The statement of purpose, Letters of recommendation, Resume,Relevant work experience
Research Scientists, Lecturer, Mathematicians, Assistant Professors