A New Approach for Solving Assignment Problem by using Divided Star Graph – DSG Method
Main Article Content
Abstract
In this paper introduced solving Assignment problem in another way by using divided star graph directly with algorithm and solution steps. The edges are represented the cost of assigning person to task after divided method, the nodes are represented the tasks and persons after divided method. The solution will be by choosing the minimum cost (edge) from the costs (edges) and delete the selected edge as well as nodes associated with the corresponding edge, then delete all other edges associated with the nodes.
Downloads
Metrics
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
