摘要
二维0-1整数规划模型应用广泛,对广义指派问题的研究,解决了一些二维0-1整数规划问题。但有些实际问题具有特殊上限约束,目前还没有对应的方法。针对该实际情形,本文建立了相应的数学模型,利用对指派模型的推广,求得问题最优解,从理论上解决了这一类特殊约束二维0-1整数规划的最优解求取问题。并通过算例说明了方法的使用。
Two-dimension zero-one programming has been widely used in many fields.The recent study on generalized assignment problem has solved some of those two-dimension zero-one programming problems.But there is no corresponding solution when those problems are restricted by some upper bound.This paper establishes the corresponding mathematical model for the kind of problems and obtained its optimum solution by further developing the assignment problem model.This method can obtain the optimum solutions to all those problems in theory.An example is used to illustrate this detailed method in the paper.
出处
《运筹与管理》
CSCD
2007年第3期66-68,共3页
Operations Research and Management Science
关键词
运筹学
指派问题
匈牙利算法
0-1规划
operational research
assignment problem
Hungary algorithm
zero-one programming
