期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：2
出版社：S.S. Mishra
摘要：Combinatorial optimization problems form a set of problems which need a considerable effort and time to be solved. Their difficulty lies in the fact that there is no formula for solving them exactly. Every possibility has to be examined in order to find the best solution and the number of possibilities increases exponentially as the size of the problem increases. I n this paper we discussed about the N queen problem which is one of the most popular NP - hard problem and various methods to solve n queen problem
关键词：NP-Hard Problems; N-Queen Problem; ACO; Genetic Algorithm; DNA Sticker Algorithm
