Course Description

Course CodeCourse NameCreditsHours
3733006 combinatorial optimization 3.0 3
Description This course is a undergraduate-level course in optimization theory and practice. The course will introduce classical combinatorial optimization problems such as the traveling salesman problem, the backpack problem, the minimum spanning tree, and the scheduling problem and their mathematical models. The course will also provide an overview of approximate algorithms, heuristic algorithms and other solving tools, and discuss the introduction and application of the methods in this course with practical examples.