PhD Algorithms, Combinatorics and Optimization at Carnegie Mellon University

The interdisciplinary PhD in Algorithms, Combinatorics and Optimization (ACO) is the first of its kind in the United States. It is administered jointly by the Tepper School of Business (Operations Research group), the Computer Science Department (Theory and Algorithms and Complexity groups) and the Department of Mathematical Sciences (Discrete Mathematics group). Applicants are selected by ACO faculty in consultation with committees in each home department.

Faculty: Kenneth C. Griffin School of Computer Science  |  Department: Computer Science Department (joint with Tepper School of Business and Department of Mathematical Sciences)  |  Intake: Fall (August); one admission cycle per year  |  Study mode: full-time  |  Location: Pittsburgh, PA, United States

What you will study

The programme combines study of the mathematical structure of discrete objects with the design and analysis of algorithms, in areas such as graph theory, combinatorial optimization, integer programming, polyhedral theory, computational algebra, geometry and number theory.

Official programme page