Variants of the hungarian method for assignment problems

Kuhn, Harold W.

doi:10.1002/nav.3800030404

Cited by 375 publications

(224 citation statements)

References 5 publications

Supporting

Mentioning

214

Contrasting

Unclassified

Order By: Relevance

“…The first polynomial-time primal-dual algorithm for the LSAP is the Hungarian method due to Kuhn [118]. In the Hungarian method a starting dual solution is obtained by so-called row and column reductions:…”

Section: The Hungarian Methodsmentioning

confidence: 99%

Linear Assignment Problems and Extensions

Burkard

Çela

1999

Handbook of Combinatorial Optimization

252

150

View full text Add to dashboard Cite

This paper aims at describing the state of the art on linear assignment problems (LAPs). Besides sum LAPs it discusses also problems with other objective functions like the bottleneck LAP, the lexicographic LAP, and the more general algebraic LAP. We consider different aspects of assignment problems, starting with the assignment polytope and the relationship between assignment and matching problems, and focusing then on deterministic and randomized algorithms, parallel approaches, and the asymptotic behaviour. Further, we describe different applications of assignment problems, ranging from the well know personnel assignment or assignment of jobs to parallel machines, to less known applications, e.g. tracking of moving objects in the space. Finally, planar and axial three-dimensional assignment problems are considered, and polyhedral results, as well as algorithms for these problems or their special cases are discussed. The paper will appear in the Handbook of Combinatorial Optimization to be published by Kluwer Academic Publishers, P. Pardalos and D.-Z. Du, eds.

show abstract

Section: The Hungarian Methodsmentioning

confidence: 99%

Linear Assignment Problems and Extensions

Burkard

Çela

1999

Handbook of Combinatorial Optimization

252

150

View full text Add to dashboard Cite

show abstract

“…The Hungarian algorithm is one of a group of algorithms that have been devised to solve the linear assignment problem within a certain time and bounded by a polynomial expression for the number of agents [38,39]. The Hungarian method of finding an optimal assignment is explained in more detail in [38].…”

Section: Hungarian Algorithmmentioning

confidence: 99%

An Automatic User Grouping Model for a Group Recommender System in Location-Based Social Networks

Khazaei

Alimohammadi

2018

IJGI

View full text Add to dashboard Cite

Spatial group recommendation refers to suggesting places to a given set of users. In a group recommender system, members of a group should have similar preferences in order to increase the level of satisfaction. Location-based social networks (LBSNs) provide rich content, such as user interactions and location/event descriptions, which can be leveraged for group recommendations. In this paper, an automatic user grouping model is introduced that obtains information about users and their preferences through an LBSN. The preferences of the users, proximity of the places the users have visited in terms of spatial range, users' free days, and the social relationships among users are extracted automatically from location histories and users' profiles in the LBSN. These factors are combined to determine the similarities among users. The users are partitioned into groups based on these similarities. Group size is the key to coordinating group members and enhancing their satisfaction. Therefore, a modified k-medoids method is developed to cluster users into groups with specific sizes. To evaluate the efficiency of the proposed method, its mean intra-cluster distance and its distribution of cluster sizes are compared to those of general clustering algorithms. The results reveal that the proposed method compares favourably with general clustering approaches, such as k-medoids and spectral clustering, in separating users into groups of a specific size with a lower mean intra-cluster distance.

show abstract

“…A weighted bipartite graph is a graph whose vertices are divided into two disjoint sets U and V such that every edge connects a vertex in U to one in V with a weight W. Figure 5 gives an example of weighted bipartite graph. Hungarian algorithm (Kuhn and Yaw, 1955) is one of many algorithms which were devised to solve the linear assignment problem. Hungarian algorithm is based on the viewpoint that an optimal assignment for the resulting cost matrix is also an optimal assignment for the original cost matrix if a number is added to or subtracted from all entries in any one row or column of a cost matrix.…”

Section: Assignment Problemmentioning

confidence: 99%

Paper-to-reviewer assignment, based on expertise degree of reviewers and relevance degree between reviewers and papers

Watanabe

2014

IJKWI

View full text Add to dashboard Cite

Automating the process of paper-to-reviewer assignment is a difficult task to be adequately resolved. Many papers concerning the related topics have been published, but there is still scare of systematic research applications. In most real world conference management, the assignment task is carried out manually by the programme committee, lacking of intelligent assigning rules and efficient matching method. The manual assignment is not only of low efficiency but also does not guarantee to result in the best solution. Given such situation, our paper sets out to analyse the problem of reviewer selection and propose a method for automatically matching papers with reviewers. Our objective is to reduce the loads of both programme committee and reviewers and make the conference-paper assignment task effectual. In this paper, we address this issue of paper-to-reviewer assignment and propose a method to model reviewers, based on the matching degree between reviewers and papers by combining preference-based approach and topic-based approach. We explain the assignment algorithm and show the evaluation results in comparison with Hungarian algorithm.Keywords: Paper-to-reviewer assignment, Hungarian algorithm, matching degree, expertise degree, relevance degree between reviewer and paper.Reference to this paper should be made as follows: Li, X. and Watanabe, T. (2014) 'Paper-to-reviewer assignment, based on expertise degree of reviewers and relevance degree between reviewers and papers', Int.

show abstract

Variants of the hungarian method for assignment problems

Cited by 375 publications

References 5 publications

Linear Assignment Problems and Extensions

Linear Assignment Problems and Extensions

An Automatic User Grouping Model for a Group Recommender System in Location-Based Social Networks

Paper-to-reviewer assignment, based on expertise degree of reviewers and relevance degree between reviewers and papers

Contact Info

Product

Resources

About