Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,168,053 papers from all fields of science
Search
Sign In
Create Free Account
Hungarian algorithm
Known as:
KM algorithm
, Kuhn-Munkres algorithm
, Munkres' assignment algorithm
Expand
The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Algorithm
Assignment problem
Auction algorithm
Breadth-first search
Expand
Broader (1)
Combinatorial optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
An Visual Motion Tracking of Multi-Object Using Hungarian Method
D. Nandashri
,
P. Smitha
2015
Corpus ID: 120690442
The tracking by detection method used to track the multiple objects, visual motion by detecting the objects in the frames and…
Expand
2012
2012
ON THE ( UN ) BEARABLE LIGHTNESS OF BEING AN LFG STYLE COPULA IN HUNGARIAN
T. Laczkó
,
T. H. King
2012
Corpus ID: 40827622
This paper develops the first comprehensive LFG analysis of the five most important types of copula constructions in Hungarian. I…
Expand
2011
2011
The optimal assignment problem: an investigation into current solutions, new approaches and the doubly stochastic polytope
Frans-Willem Vermaak
2011
Corpus ID: 55303589
MSc(Eng),Faculty of Engineering and the Built Environment, University of the Witwatersrand, 2010
2011
2011
Offline signature using Cross validation and Graph matching approach
Dipali K. Bhole
,
A. Vidhate
,
Shrikant Velankar
2011
Corpus ID: 5192892
Compared to physiologically Base biometric system such as fingerprint, face, palm- vein and retina, behavioral based system such…
Expand
2009
2009
Benders' Decomposition Based Heuristics for Large-Scale Dynamic Quadratic Assignment Problems
Sirirat Muenvanichakul
,
Peerayuth Charnsethikul
2009
Corpus ID: 739542
Problem statement: Dynamic Quadratic Assignment Problem (DQAP) is NP hard problem. Benders decomposition based heuristics method…
Expand
2008
2008
Interactive Chinese Character Learning System though Pictograph Evolution
J. Low
,
Chee-Onn Wong
,
E. Han
,
K. Jung
,
H.-K. Yang
2008
Corpus ID: 14878759
This paper proposes an Interactive Chinese Character Learning System (ICCLS) based on pictorial evolution as an edutainment…
Expand
2007
2007
Submitted on: First referee: Second referee: Supervisor:
2007
Corpus ID: 9200058
1999
1999
A Local Search Approach to K-Clustering
Bin Zhang
,
Gary Kleyner
,
M. Hsu
1999
Corpus ID: 16590711
Data clustering is o ne of the common techniques used in data mining. A popular performance function for measuring goodness of…
Expand
1995
1995
Iterative histogram modification of gray images
P. Bhattacharya
,
Yan Yan
IEEE Transactions on Systems, Man and Cybernetics
1995
Corpus ID: 7434100
We develop an iterated histogram modification algorithm for enhancing gray images. The modified image has very few gray levels…
Expand
1961
1961
Letter to the Editor—An Application of the Assignment Problem
R. Machol
1961
Corpus ID: 121910667
The famous physician who discovered a cure for which there was no known disease has his parallel in many OR discoveries of…
Expand