A new algorithm for the assignment problem: An alternative to the Hungarian method

Computers and Operations Research

Volumn 24, Issue 11, 1997, Pages 1017-1023

  Ji, Ping ^a   Lee, W B ^a   Li, Hongyu ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; COST EFFECTIVENESS; EFFICIENCY; MATRIX ALGEBRA; OPTIMIZATION;

ASSIGNMENT PROBLEM;

INDUSTRIAL MANAGEMENT;

EID: 0031281281     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(97)00019-1     Document Type: Article

References (10)

1. Kuhn, H. W., The Hungarian method for the assignment problem. Naval Research Logistics, 1955, 2, 83-97.
2. Lotfi, V., A labeling algorithm to solve the assignment problem. Computers and Operations Research, 1989, 16, 397-408.
3. Balinski, M. L., A competitive (dual) simplex method for the assignment problem. Mathematical Programming, 1986, 34, 125-141.
4. Goldfarb, D., Efficient dual simplex methods for the assignment problem. Mathematical Programming, 1985, 33, 187-203.
5. Hung, M. S., A polynomial simplex method for the assignment problem. Operations Research, 1983, 31, 595-600.
6. Paparrizos, K., An infeasible (exterior point) simplex algorithm for assignment problems. Mathematical Programming, 1991, 51, 45-54.
7. Balinski, M. L., Signature methods for the assignment problem. Operations Research, 1985, 33, 527-536.
8. Orlin, J. B. and Ahuja, R. K., New scaling algorithms for the assignment and minimum mean cycle problems. Mathematical Programming, 1992, 54, 41-56.
9. Hung, M. S. and Rom, W. O., Solving the assignment problem by relaxation. Operations Research, 1980, 28, 969-982.
10. Hillier, F. S. and Lieberman, G. J., Introduction to Operations Research, 6th edn. McGraw-Hill, New York, 1995.