Open AccessOptimization Algorithm’s Problems: Comparison Study
Author(s) -
Rebaz Mala Nabi,
R. Muhammad Atif Azad,
Soran Saeed,
Rebwar M. Nabi
Publication year - 2017
Publication title -
kurdistan journal of applied research
Language(s) - English
Resource type - Journals
eISSN - 2411-7706
pISSN - 2411-7684
DOI - 10.24017/science.2017.3.15
Subject(s) - sort , mathematical optimization , shortest path problem , computer science , path (computing) , algorithm , matching (statistics) , process (computing) , optimization problem , minimum spanning tree , tree (set theory) , mathematics , graph , theoretical computer science , statistics , information retrieval , programming language , operating system , mathematical analysis
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.