首页 | 本学科首页   官方微博 | 高级检索  
     

利用最小调整法求解特殊的二维0-1规划
引用本文:夏少刚,刘佳. 利用最小调整法求解特殊的二维0-1规划[J]. 运筹与管理, 2008, 17(1): 24-28
作者姓名:夏少刚  刘佳
作者单位:东北财经大学,数学与数量经济学学院,辽宁,大连,116023
摘    要:具有特殊约束的二维0-1规划的实际应用广泛,在解法中多是应用传统算法,或是在它基础上进行改进,但是此类解法计算繁琐不易推广.针对这种情形,本文引入最小调整法处理此类问题,并将其与传统算法进行对比,充分展示了该方法的优越性,呈现出灵活、方便、简单、易行的特点.通过举例验证了方法的有效性.

关 键 词:运筹学  0-1规划  分派问题  最小调整法  利用  最小  调整法  求解  规划  Programming  Special  有效性  举例验证  方法  问题  处理  计算  改进  算法  解法  应用  约束
文章编号:1007-3221(2008)01-0024-05
收稿时间:2007-10-26
修稿时间:2007-10-26

Using the Least Adjustment Method to Solve the Special Two-dimension Zero-one Programming
XIA Shao-gang,LIU Jia. Using the Least Adjustment Method to Solve the Special Two-dimension Zero-one Programming[J]. Operations Research and Management Science, 2008, 17(1): 24-28
Authors:XIA Shao-gang  LIU Jia
Abstract: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.
Keywords:operational research   zero-one programming   assignment problem   the least adjustment method
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号