An Efficient Algorithm for Obtaining the Optimum Solution of a Generalized Assignment Problem

被引：0

作者：

HUANG De\|cai College of Information Engineering

机构：

来源：

Journal of Systems Science and Systems Engineering | 1999年 / 03期

关键词：

assignment problem; business management; linear programming;

D O I：

暂无

中图分类号：

O221.2 [非线性规划];

学科分类号：

070105 ; 1201 ;

摘要：

This paper considers a generalized assignment problem. After intensively analyzing and researching, the generalizsed assignment problem is ingeniously reduced to a traditional assignment problem of which the optimum solution can be easily obtained by a famous method:Hungary algorithm. Finally, an illustrating example is given.

引用

页码：314 / 319

页数：6