Please use this identifier to cite or link to this item:
|Title:||A new algorithm for the assignment problem: An alternative to the Hungarian method||Authors:||Ji, P.
|Issue Date:||1997||Citation:||Ji, P.,Lee, W.B.,Li, H. (1997). A new algorithm for the assignment problem: An alternative to the Hungarian method. Computers and Operations Research 24 (11) : 1017-1023. ScholarBank@NUS Repository.||Abstract:||This paper presents a new algorithm for the well-studied assignment problem. Our assignment algorithm is based on a 2n × 2n matrix. The dual to the assignment problem is considered in this paper by relaxing the constraints of the original assignment problem. A 2n × 2n matrix is formed for an initial feasible solution to the dual. Then operations are performed on the matrix until an optimal solution is found. © 1997 Elsevier Science Ltd.||Source Title:||Computers and Operations Research||URI:||http://scholarbank.nus.edu.sg/handle/10635/44927||ISSN:||03050548|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 23, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.