Conference
Replacement cost method for the best assignment.
| Title: | Replacement cost method for the best assignment. |
|---|---|
| Authors: | Abdulhussein, Sabah F.1 (AUTHOR) sabah.f.abdulhussein@almamonuc.edu.iq |
| Source: | AIP Conference Proceedings. 2026, Vol. 3460 Issue 1, p1-11. 11p. |
| Subject Terms: | *Assignment problems (Programming), *Optimization algorithms, *Mathematical optimization |
| Abstract: | This research aims to propose a new method that achieves directly the optimal solution to the assignment problem, even if it is maximization problem, and with only one or two simple steps. The first step is to make the initial allocation by specifying the allocating cell that has the lowest cost or the largest profit in each row. If it is comprehensive so that just a row is allocated to each column, the optimal assignment is achieved, otherwise the second step must be applied using replacement rule. Both this proposed method and Hungarian's have reached the optimal assignment with the distinction of the proposed method as direct and simple. [ABSTRACT FROM AUTHOR] |
| Database: | Academic Search Index |
Be the first to leave a comment!