此參考說明所註明的目錄。請向該機構確認當前課程供給與適用於你入學的條件。
課程說明
離散最佳化 離散最佳化之問題與方法。線性規劃：問題表述、單純形法、軟體與應用。網路模型：指派問題、最大流問題。有向圖：拓樸排序、動態規劃與路徑問題、與旅行推銷員問題。一般圖論：歐拉與哈密頓路徑與迴路，以及匹配。講授，每週 3 小時；實驗，每週 1 小時。先修條件：MATH 1P11 或 1P12。備註：本課程可能以多種授課模式提供。授課方式將列於學期課程時間表。需付軟體費。修畢本課程將替代先前在 MATH 2P72 所取得之分數與學分。
先修條件
- 先修條件：MATH 1P11 或 1P12。
條件與方式
- 先修條件：MATH 1P11 或 1P12。
- 備註：本課程可能以多種授課模式提供。授課方式將列於學期課程時間表。需付軟體費。修畢本課程將替代先前在 MATH 2P72 所取得之分數與學分。
原文參考文本
Discrete Optimization Problems and methods in discrete optimization. Linear programming: problem formulation, the simplex method, software, and applications. Network models: assignment problems, max-flow problem. Directed graphs: topological sorting, dynamic programming and path problems, and the travelling salesman's problem. General graphs: Eulerian and Hamiltonian paths and circuits, and matchings. Lectures, 3 hours per week; lab, 1 hour per week. Prerequisite(s): MATH 1P11 or 1P12 Note: this course may be offered in multiple modes of delivery. The method of delivery will be listed on the academic timetable, in the applicable term. Software Fee Required. Completion of this course will replace previous assigned grade and credit obtained in MATH 2P72.
- Prerequisite(s): MATH 1P11 or 1P12
- Note: this course may be offered in multiple modes of delivery. The method of delivery will be listed on the academic timetable, in the applicable term. Software Fee Required. Completion of this course will replace previous assigned grade and credit obtained in MATH 2P72.
來源與參考
保留日期與來源以協助你核實資料。為便於閱讀提供譯文；官方來源為條件與要求的參照。
來源參考 : https://brocku.ca/webcal/2024/undergrad/math.html