该参考描述所示目录。请向院校确认当前的招生项目及适用于您入学年的条件。
描述
离散优化 离散优化中的问题与方法。线性规划：问题表述、单纯形法、软件与应用。网络模型：指派问题、最大流问题。有向图：拓扑排序、动态规划与路径问题、旅行商问题。一般图论：欧拉与哈密顿路径与回路、匹配问题。讲座，每周 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