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

Sahil Ahuja, Anu Kathuria

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

How to Cite?: Sahil Ahuja, Anu Kathuria, "A New Optimality Criteria for Efficiently Solving an Assignment Problems in Combinatorial Optimization", Volume 12 Issue 5, May 2023, International Journal of Science and Research (IJSR), Pages: 2228-2233, https://www.ijsr.net/getabstract.php?paperid=SR23528084407, DOI: https://dx.doi.org/10.21275/SR23528084407