在一般逻辑教科书中,把“以偏概全”作为一种逻辑错误,并指出在运用简单枚举法时应注意避免。
In common logic textbooks, "taking a part for the whole" is considered as a logic error, so we are warned against such errors when using simple enumeration method.
采用枚举搜索法具有方法简单、编程容易的优点,但计算量非常大、搜索效率非常低。
Enumerating-search method is easy to program, but the searching efficiency is very low because of vast calculating amount.
本文提出用0 - 1整数规划的隐枚举法,求解网络的多中心问题,算法简单,容易实现。
In this paper, the problem of multi-centres in a network is solved using implicit enumeration method for 0-1 integer programming. The algorithm is simple and can be easily realized.
应用推荐