International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 11 | Views: 102 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1

Research Paper | Mathematics and Informatics | India | Volume 12 Issue 5, May 2023

A New Optimality Criteria for Efficiently Solving an Assignment Problems in Combinatorial Optimization

Sahil Ahuja | Anu Kathuria [3]

Abstract: The assignment problem, a fundamental combinatorial optimization operations research, optimally assigning n n tasks to n resources. While efficient algorithm exist such as the one proposed by Harold Kuhn in 1955. This paper presents a novel optimality criterion that requires fewer iterations, thus increasing computational efficiency. This proposed method is a systematic procedure, applicable to all types of assignment problems regardless of whether the objective function is to be maximized or minimized.

Keywords: Assignment problem, Opportunity Cost, Combinatorial Optimization, Operations Research, Mathematical Modeling, Algorithm Efficiency

Edition: Volume 12 Issue 5, May 2023,

Pages: 2228 - 2233

How to Download this Article?

Type Your Valid Email Address below to Receive the Article PDF Link

Verification Code will appear in 2 Seconds ... Wait