|
Chris Groër Computational Mathematics Group Computer Science and Mathematics Division
|
|
I am a computational mathematician with research interests in large scale combinatorial optimization, job scheduling, and the application of high performance computing to non-traditional areas such as operations research.
My current research projects: · Job Scheduling Strategies for Heterogeneous Systems: This project focuses on scheduling software and algorithms for efficient and effective use of heterogeneous resources. This work is with Greg Koenig, Chung Hsing Hsu, Ed Begoli, Steve Poole (ORNL), as well as teams at Colorado State and Adaptive Computing. · Scalable Graph Decomposition: This project aims to utilize tree and branch decompositions of large graphs as techniques to attack large graph problems with distributed memory computing. This work is with Blair Sullivan (ORNL) and is supported by the DOE Applied Math Program. · Vehicle Routing: I am the developer and maintainer of an open-source C/C++ software library for generating solutions to routing problems using local search-based metaheuristics. The software is freely available under the Common Public license and is hosted by COIN-OR at www.coin-or.org/projects/VRPH.xml .
Education · Ph.D., Applied Mathematics and Scientific Computation, University of Maryland, 2008. Dissertation: Parallel and Serial Algorithms for Vehicle Routing Problems, Advisor: Bruce Golden · M.A, Mathematics, University of Georgia, 2001. Thesis: The Josephus Problem, Advisor: Andrew Granville. · B.A., Mathematics and Economics, Vanderbilt University, 1996. Links: · CV/Resume available upon request |
