摘要
具有特殊约束的二维0-1规划的实际应用广泛,在解法中多是应用传统算法,或是在它基础上进行改进,但是此类解法计算繁琐不易推广。针对这种情形,本文引入最小调整法处理此类问题,并将其与传统算法进行对比,充分展示了该方法的优越性,呈现出灵活、方便、简单、易行的特点。通过举例验证了方法的有效性。
The practical application of the two-dimension zero-one programming is extensive, but it subjects to the constraints such as traditional algorithm or the improvement on the basis of other methods. Therefore it is difficult to be promoted for its complicated calculation. In this situation, this paper adopts the least adjustment method and contrasts it with the traditional one, then its superiority and other excellent characteristics can be fully demonstrated including flexibility, convenience, simplification . The effectiveness of the least adjustment method is used to be tested by the examples.
出处
《运筹与管理》
CSCD
2008年第1期24-28,共5页
Operations Research and Management Science
关键词
运筹学
0-1规划
分派问题
最小调整法
operational research
zero-one programming
assignment problem
the least adjustment method
