| |
Jan 15, 2025
|
|
|
|
|
MATH 228 - Combinatorial Optimization
Semester Hours: 3
Combinatorial optimization fuses combinatorics, graph theory, and analysis to study optimal problems in computer science, operation research, and real-life problems. It uses tools from matrix theory, linear programming, flows on graphs, integer programming, and other tools. It also deals with many aspects of algorithms in computer science, and gives practical solutions to NP-complete and NP-hard problems.
Prerequisite(s)/Course Notes:
Course open to graduate students in Computer Science/Data Science, others need permission.
Add to Personal Catalog (opens a new window)
|
|