Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/44927
DC FieldValue
dc.titleA new algorithm for the assignment problem: An alternative to the Hungarian method
dc.contributor.authorJi, P.
dc.contributor.authorLee, W.B.
dc.contributor.authorLi, H.
dc.date.accessioned2013-10-10T04:37:54Z
dc.date.available2013-10-10T04:37:54Z
dc.date.issued1997
dc.identifier.citationJi, 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.
dc.identifier.issn03050548
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/44927
dc.description.abstractThis 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.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentDECISION SCIENCES
dc.description.sourcetitleComputers and Operations Research
dc.description.volume24
dc.description.issue11
dc.description.page1017-1023
dc.description.codenCMORA
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

167
checked on Aug 19, 2019

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.