Rebaz M. Nabi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Rebaz M. Nabi has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Rania Azad M. San Ahmed
Sulaimani Polytechnic University
1 shared publication - Rebwar Mala Nabi
Information Technology Department, Technical College of Informatics, Sulaimani Polytechnic University, Sulaimani, Iraq
1 shared publication - Soran Ab. M. Saeed
University of Human Development
1 shared publication
Latest Publications
- Open Access
- 27 August 2017
- Published by Sulaimani Polytechnic University in Kurdistan Journal of Applied Research
- Vol. 2 (3) , 25-31
Optimization Algorithm’s Problems: Comparison Study
Currently, in various fields and disciplines problem optimization are used commonly. In this concern, we have to define solutions which are two known concepts optimal or near optimal optimization problems in regards to some objects. Usually, it is surely difficult to sort problems out in only one step, but some processes can be followed by us which people usually call it problem solving. Frequently, the solution process is split into various steps which are accomplishing one after the other. Therefore, in this paper we consider some algorithms that help us to sort out problems, for exemplify, finding the shortest path, minimum spanning tree, maximum network flows and maximum matching. More importantly, the algorithm comparison will be presented. Additionally, the limitation of each algorithm. The last but not the least, the future research in this area will be approached.
- 27 August 2017
- Published by Sulaimani Polytechnic University in Kurdistan Journal of Applied Research
- Vol. 2 (3) , 25-31
Open AccessOptimization Algorithm’s Problems: Comparison Study
Currently, in various fields and disciplines problem optimization are used commonly. In this concern, we have to define solutions which are two known concepts optimal or near optimal optimization problems in regards to some objects. Usually, it is surely difficult to sort problems out in only one step, but some processes can be followed by us which people usually call it problem solving. Frequently, the solution process is split into various steps which are accomplishing one after the other. Therefore, in this paper we consider some algorithms that help us to sort out problems, for exemplify, finding the shortest path, minimum spanning tree, maximum network flows and maximum matching. More importantly, the algorithm comparison will be presented. Additionally, the limitation of each algorithm. The last but not the least, the future research in this area will be approached.