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


An Efficient Algorithm for Obtaining the Optimum Solution of a Generalized Assignment Problem
Authors:HUANG De\|cai College of Information Engineering  Zhejiang University of Technology  Hangzhou  China
Institution:HUANG De\|cai College of Information Engineering,Zhejiang University of Technology,Hangzhou 310014,China
Abstract: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.
Keywords:assignment problem  business management  linear programming
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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