TY  - JOUR
AU  - Ahmad, Hlayel Abdallah 
PY  - 2012
TI  - The Best Candidates Method for Solving Optimization Problems
JF  - Journal of Computer Science
VL  - 8
IS  - 5
DO  - 10.3844/jcssp.2012.711.715
UR  - https://thescipub.com/abstract/jcssp.2012.711.715
AB  - Problem statement: This study is about describing solution technique called Best Candidates Method (BCM) for solving optimization problems; the goal is to minimize the computation time to get the optimal solution. In this study I apply the BCM to the linear assignment problems (LAP) that is one of the optimization problems in the Operation Research (OR). Approach: The optimization problem solution methods operate in two ways. First, that find all available combinations in sequential or parallel solution manner then compare the results to get the optimal one, but its need a very large computation time either for a large scale problems. Second, is to try to reach directly the optimal solution using different methods, but all available methods not always reach the optimal solution and have a complex solution technique or have a long computation time. Results: The BCM elect the best candidates that give the lowest combinations to get the optimal solution. Conclusion/Recommendations: The BCM minimize the computation time and reduce the complexity where we can apply this method to different area of optimization problems.