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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

Non-Orthogonal Multiple Access (NOMA) and Fog Radio Access Networks (FRAN) are promising candidates within the 5G and beyond…

2017

– The purpose of this paper is to solve an assignment problem with linguistic costs/ times. In this paper, an assignment problem…

2015

This article presents an algorithm for online multirobot coverage that proceeds with minimal knowledge of the already explored…

2015

Abstract Among the data clustering algorithms, the k-means (KM) algorithm is one of the most popular clustering techniques…

2012

This paper develops the first comprehensive LFG analysis of the five most important types of copula constructions in Hungarian. I…

2012

Karnik-Mendel (KM) algorithms used for type reduction (TR) followed by defuzzification are commonly used in interval type-2 fuzzy…

2012

In vision data processing often the positions of detected objects have to be determined. This can be done by many sophisticated…

2011

Compared to physiologically Base biometric system such as fingerprint, face, palm- vein and retina, behavioral based system such…

1995

We develop an iterated histogram modification algorithm for enhancing gray images. The modified image has very few gray levels…

1961

The famous physician who discovered a cure for which there was no known disease has his parallel in many OR discoveries of…