Authors : Langote Ulhas Baban; Dr. Mulay Prashant P.; Vyas Sandeepkumar Madanlal; Dhore Surekha

Volume/Issue : Volume 10 - 2025, Issue 3 - March

---

Google Scholar : https://tinyurl.com/4a72x2sa

Scribd : https://tinyurl.com/3em2hvn6

DOI : https://doi.org/10.38124/ijisrt/25mar1143

Google Scholar

Note : A published paper may take 4-5 working days from the publication date to appear in PlumX Metrics, Semantic Scholar, and ResearchGate.

Note : Google Scholar may take 15 to 20 days to display the article.

---

Abstract : One of the way is to find optimum solution of matching problem is solution of assignment problem by Hungarian method. There is relation between Matching problem and Assignment problem. By applying algorithms, it gives consistency and efficiency of matching problem.

References :

1. Kuhn, H. W. (1955). "The Hungarian method for the assignment problem." Naval Research Logistics Quarterly, 2(1-2), 83-97.
2. Kőnig, D. (1931). "Graphen und Matrizen." Matematikai és Fizikai Lapok, 38, 116-119.
3. Burkard, R. E., Dell’Amico, M., & Martello, S. (2009). Assignment Problems. Springer.
4. "The Prize in Economic Sciences 2012". Nobelprize.org. Retrieved 2013-09-09.
5. Pittel, Boris (1989). "The average number of stable matchings". SIAM Journal on Discrete Mathematics. 2 (4): 530–549. doi:10.1137/0402048. MR 1018538.
6. Harry Mairson: "The Stable Marriage Problem", The Brandeis Review 12, 1992 (online).