Skip to search formSkip to main contentSkip to account menu

Hungarian algorithm

Known as: KM algorithm, Kuhn-Munkres algorithm, Munkres' assignment algorithm 
The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
AlgorithmAssignment problemAuction algorithmBreadth-first search

Broader (1)

Combinatorial optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A novel hybrid K-means and artificial bee colony algorithm approach for data clustering
Article history: Received September 16, 2016 Received in revised format: October22, 2016 Accepted April15, 2017 Available online… 
2017
2017
Energy-Efficient Cooperation in Cognitive Wireless Powered Networks
In this letter, we consider a cooperative sharing model for cognitive wireless powered communication networks (CWPCNs), which… 
2015
2015
Cluster, Allocate, Cover: An Efficient Approach for Multi-robot Coverage
This article presents an algorithm for online multirobot coverage that proceeds with minimal knowledge of the already explored… 
2015
2015
An analytical solution to the TOPSIS model with interval type-2 fuzzy sets
TOPSIS is a popular used model for multiple attribute decision-making problems. Recently, Chen and Lee (Exp Syst Appl 37(4):2790… 
2014
2014
Assignment algorithms for modeling resource contention and interference in multi-robot task-allocation
We consider optimization of the multi-robot task-allocation problem when the overall performance of the team need not be a… 
2014
2014
Approximate Graph Edit Distance Guided by Bipartite Matching of Bags of Walks
The definition of efficient similarity or dissimilarity measures between graphs is a key problem in structural pattern… 
2013
2013
Spectrum sharing optimization with QoS guarantee in cognitive radio networks
2012
2012
Development of evolutionary data mining algorithms and their applications to cardiac disease diagnosis
This paper presents two kinds of evolutionary data mining (EvoDM) algorithms, termed GA-KM and MPSO-KM, to cluster the dataset of… 
Highly Cited
2010
Highly Cited
2010
Face and Human Gait Recognition Using Image-to-Class Distance
We propose a new distance measure for face recognition and human gait recognition. Each probe image (a face image or an average… 
2008
2008
Coherency approach by hybrid PSO, K-Means clustering method in power system
This paper presents a new method for recognition the identical behaviors of synchronous generators for particular fault location… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)