Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/26645
Title: A new algorithm for the assignment problem : an alternative to the Hungarian method
Authors: Ji, P 
Lee, WB 
Li, H
Issue Date: 1997
Publisher: Pergamon Press
Source: Computers and operations research, 1997, v. 24, no. 11, p. 1017-1023 How to cite?
Journal: Computers and operations research 
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.
URI: http://hdl.handle.net/10397/26645
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/S0305-0548(97)00019-1
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

10
Last Week
0
Last month
0
Citations as of Jul 28, 2017

WEB OF SCIENCETM
Citations

9
Last Week
0
Last month
Citations as of Aug 13, 2017

Page view(s)

35
Last Week
3
Last month
Checked on Aug 21, 2017

Google ScholarTM

Check

Altmetric



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