摘要
穷举法是一种简单易懂、应用广泛的常用算法,对于较复杂的问题,穷举法的适用性受很多限制,不能有效解决实际问题。因此探索使用多维穷举法来解决实际工作经常遇到的排班问题,并以"蓝桥杯"全国软件专业人才设计与创业大赛全国总决赛中的一道综合编程题为例,解析二维穷举法的求解方法和具体实现。
Exhaustive method is a simple and easy to understand and widely used algorithm.For more complex problems,the applicability of exhaustive method is limited,and it can not effectively solve the problems.Therefore,the multidimensional exhaustive method is used to solve the scheduling problem.The question of"Lanqiao"competition as an example,methods for solving two-dimensional analytic exhaustive method and implementation.
出处
《电脑知识与技术（过刊）》
2017年第9X期82-83,共2页
Computer Knowledge and Technology
关键词
算法
多维穷举法
排班
Algorithm
multidimensional exhaustion method
scheduling
