|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/master-assignment-problem-algorithm/
课程评论：没有评论
课程名称：主分配问题算法 课程概览： 本课程是运筹学（Operations Research）的基础工具介绍，运筹学是一系列用于解决商业相关问题的数学工具。课程将重点讲解和演示“分配问题”（Assignment Problem, AP）的手动解决方法，并辅以多个实例。 分配问题通常是在资源与用途一一对应的情况下，对某一特定参数进行最大化或最小化。课程将详细介绍被称为“匈牙利分配问题”的手动解法，通过解决最大至6x6规模的问题来展示其操作过程。匈牙利分配问题是一种简单而有效的算法，适用于解决“资源分配给用途”类型的问题，例如：工人分配给任务、销售员分配给区域、房间分配给经理，或航线分配给航班等。解决这类问题的关键在于通过画出最少数量的横线或竖线来覆盖所有的零。本课程将提供清晰的步骤和充足的练习，帮助学生掌握这一技巧。 （其他运筹学工具如线性规划、关键路径法、排序问题、博弈论、运输问题等，可在讲师的其他课程中找到。）
The basic tools of Operations Research (OR). OR is a bunch of mathematical tools to solve business-related problems. (For other tools like Linear Programming, Critical Path Method, Sequencing Problem, Game theory, Transportation Problem, see other courses by the instructor)The manual method to solve (AP) will be discussed and demonstrated with several examplesThese problems are typically to maximize or minimize the value of a certain parameter given a situation that the resources and their uses are matched one-on-one basis in case of an Assignment Problem.The manual method also known as Hungarian Assignment Problem is demonstrated manually by solving problems that could be upto 6x6 size. The Hungarian Assignment Problem is a very simple but effective algorithm in solving a 'resources to use' type of problem, such as assigning workers to jobs, or salesmen to different territories, or assigning rooms to managers or assigning incoming flight route to outgoing flight route etc. The key in solving a problem is drawing the minimum number of vertical or horizontal lines through Hungarian Matrix, which will cancel out all zeros. To achieve this, a very simple procedure is enumerated in the course, with enough practice so that the student can do it on her own.
