Grant: Discovery Grants Program - Individual
University of Waterloo
$52,000.00
Combinatorial optimization algorithms and polyhedra
FY 2006-07
Summary
This is fundamental research on optimization problems that arise in a discrete setting. The goal is to find results that characterize optimal solutions, and to find algorithms that construct them efficiently. It is related to industrial engineering (operations research), computer science (theory of algorithms), and mathematics (combinatorics).Possible applications occur in transportation (network optimization), communications (network design), and resource allocation. Specific problems considered include the travelling salesman problem and some variants and some extensions of matching problems on graphs. The research approach relies heavily on linear programming, linear algebra, and graph theory.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
132992-2006
Name nom
Cunningham, William
Department département
Combinatorics and Optimization
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2006
Competition year année de concours
2006
Award amount
52000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
20
Committee name en
Industrial Engineering
Committee name fr
Génie industriel
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2715
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Optimization
Research subject fr
Optimisation
Partie
1
Nb partie
5
Application title
Combinatorial optimization algorithms and polyhedra
Keyword
NA
Application summary
This is fundamental research on optimization problems that arise in a discrete setting. The goal is to find results that characterize optimal solutions, and to find algorithms that construct them efficiently. It is related to industrial engineering (operations research), computer science (theory of algorithms), and mathematics (combinatorics).Possible applications occur in transportation (network optimization), communications (network design), and resource allocation. Specific problems considered include the travelling salesman problem and some variants and some extensions of matching problems on graphs. The research approach relies heavily on linear programming, linear algebra, and graph theory.