1999•系统科学与系统工程学报(英文版)Requires access
An Efficient Algorithm for Obtaining the Optimum Solution of a Generalized Assignment Problem
Huang De
Open publisher page 0 citations
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.