- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
Using Simulated Annealing to Solve NP- Complete Problems | ||
| AL-MANSOUR JOURNAL | ||
| Article 1, Volume 0, Issue 8, 2017, Pages 28-54 | ||
| Authors | ||
| Abdul-Rahman H.Al-Husaini; ; | ||
| Abstract | ||
| Simulated annealing algorithm is a recent powerful technique for solving hard problems. Furthermore, if has a very interesting features: general applicability. In fact, it has been used successfully for solving many NP-complete problem. This paper describes elementary theoretical concepts and principles of this technique and presents. As well, some examples with results in which simulated annealing algorithm is used to solve hard problems . | ||
| Keywords | ||
| Simulated annealing; complete; heuristic; Algorithms | ||
|
Statistics Article View: 68 PDF Download: 31 |
||