James R. Lee, Ph.D.

James R. Lee is one of the leaders in the study of discrete optimization problems and their connections to analysis, geometry and probability. His development of spectral methods and his work on convex relaxations has led to breakthroughs in characterizing the efficacy of mathematical programming for combinatorial optimization.