A note of reduced dimension optimization algorithm of assignment problem

Mengzhuo Bai (), Chunyang Ren () and Yang Liu ()
Additional contact information
Mengzhuo Bai: Shenyang Normal University
Chunyang Ren: Shenyang the Fourth Hospital of People
Yang Liu: Chaoyang Branch of China Construction Bank

Journal of Combinatorial Optimization, 2015, vol. 30, issue 4, No 2, 849 pages

Abstract: Abstract Analysing the characters of the elements of the efficiency matrix of the assignment problem, we find some properties of the optimal solution. Different from the traditional algorithm, Hungarian method, we give several principles to recognize some optimal points rapidly, thus we can reduce the dimension of the assignment problem.

Keywords: Assignment problem; Inverse point; Reduced dimension (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9851-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:30:y:2015:i:4:d:10.1007_s10878-015-9851-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9851-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().