| 課程編碼 Course Code | 中文課程名稱 Course Name (Chinese) | 英文課程名稱 Course Name (English) | 總學分數 Credits | 總時數 Hours |
|---|---|---|---|---|
| 3733006 | 組合最佳化 | combinatorial optimization | 3.0 | 3 |
| 中文概述 Chinese Description | 本課程為最佳化理論和實踐的大學程度課程。課程將介紹旅行銷售員問題、背包問題、最小生成樹、排程問題等經典組合最佳化問題及其數學模型。並概述近似演算法、啟發式演算法等求解工具，並以實務案例討論本課程方法之導入及應用。 | |||
| 英文概述 English 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. | |||
備註：