Description

Discrete mathematics has a pivotal role to play in a wide variety of applications of interest to DOE including scientific computing, parallel algorithms, logistics and scheduling. The Discrete Algorithms and Math Department conducts basic and applied research in modeling, analysis and software development for such problems. The personnel in the department have expertise in a range of areas including graph algorithms, combinatorial optimization, polyhedral combinatorics, parallel computing and software development.

Selected Projects

• PICO: Parallel Integer and Combinatorial Optimization
• Zoltan: Dynamic load balancing and support for parallel applications, available under an open source license here
• Chaco: Graph partitioning and static load balancing, available under an open source license here
• The SGOPT global optimization library
• The NEOS-SRN optimization server
• The UTILIB C++ utility library

Personnel

• Suzanne Rountree, Manager
• Mel Loran, OAA
• Jonathan Berry
• Erik Boman
• Bob Carr
• Stefan Chakerian
• Karen Devine
• Lee Ann Fisk
• Bill Hart
• Bob Heaphy
• Bruce Hendrickson
• Erik Lauer
• Vitus Leung
• Cindy Phillips
• Jean-Paul Watson