Alternate Approach (Penalty Approach) to Assignment Problem Solving and Comparison to Existing Approaches
Hudu Mohammed, F. T. Oduro, S. K. Appiah
Journal of Advances in Mathematics and Computer Science · pp. 6–15 · Published 7 Jun 2023
10.9734/jamcs/2023/v38i81785Abstract
Assignment problem is an important area in Operation Research and is also discussed in real physical world. In this paper an attempt has been made to solve the assignment problem using a new Method called the Penalty method. We discuss a numerical example by using the new Method and compare it with standard existing method which is the Hungarian method. We compare the optimal solution of the new Method and the Hungarian method. The new method is a simple procedure, easy to apply for solving assignment problem.
References (11)
- 1 The Hungarian method for the assignment problem [DOI]
- 2 European journal of operational research [DOI]
- 3 Algorithms for the Assignment and Transportation Problems [DOI]
- 4 Linear Programming and Network Flows [DOI]
- 5 The Hungarian method for the assignment problem [DOI]
- 6 A New Solution to the Random Assignment Problem [DOI]
- 7 Operations research: An introduction [DOI]
- 8 Linear Programming and Network Flows [DOI]
- 9 Operations research: An introduction, 6th ed. [DOI]
- 10 A Multi-Objective Decision Support Model for the Turkish Armed Forces Personnel Assignment System
- 11 Fair and Efficient Assignment via the Probabilistic Serial Mechanism
Cited by 2
P. Senthil Kumar · Advances in Media, Entertainment, and the Arts · 2024
Showing 1 of 2 known citations — external sources report more than can currently be individually listed.
Related research
- An Application of Assignment Problem in Agriculture Using R — shares topic coverage
- Intuitionistic Fuzzy Assignment Problem: An Application in Agriculture — shares topic coverage
- Genetic Algorithm Based Hybrid Approach to Solve Optimistic, Most-likely and Pessimistic Scenarios of Fuzzy Multi-objective Assignment Problem Using Exponential Membership Function — shares topic coverage
- The Maximum Flow and Minimum Cost–Maximum Flow Problems: Computing and Applications — shares topic coverage
- The Out-of-Kilter Algorithm and Its Applications to Network Flow Problems — shares topic coverage
Article metrics
Real usage data collected on this platform.
48
Page views
0
PDF downloads
24
Outbound clicks
2
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.