DocumentCode :
1821732
Title :
A cost and space efficient method for unbalanced assignment problems
Author :
Iampang, Anupong ; Boonjing, Veera ; Chanvarasuth, Pisit
Author_Institution :
Dept. of Comput. Sci., King Mongkut´´s Inst. of Technol. Ladkrabang, Bangkok, Thailand
fYear :
2010
fDate :
7-10 Dec. 2010
Firstpage :
985
Lastpage :
988
Abstract :
In this paper, a new cost and space efficient solution to unbalanced assignment problems is presented. The new solution uses linear space complexity instead of polynomial complexity as used by the Hungarian method. Moreover, its optimal cost is lower than of the Kumar method - an existing linear space complexity solution to unbalanced assignment problems.
Keywords :
computational complexity; costing; Hungarian method; Kumar method; cost-and-space efficient solution; linear space complexity; optimal cost; unbalanced assignment problem; Complexity theory; Electronic mail; Logistics; Polynomials; Simulation; Space technology; Kumar method; Unbalanced assignment problem; the Hungarian method;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Industrial Engineering and Engineering Management (IEEM), 2010 IEEE International Conference on
Conference_Location :
Macao
ISSN :
2157-3611
Print_ISBN :
978-1-4244-8501-7
Electronic_ISBN :
2157-3611
Type :
conf
DOI :
10.1109/IEEM.2010.5674228
Filename :
5674228
Link To Document :
بازگشت