Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems.
Nasrin Mohabbati-KalejahiHossein AkbaripourEllips MasehianPublished in: IJCCI (Selected Papers) (2012)
Keyphrases
- optimization problems
- combinatorial optimization
- benchmark problems
- problems in computer vision
- test problems
- computational cost
- difficult problems
- quadratic optimization problems
- resource constrained project scheduling problem
- solving complex
- partial solutions
- solving problems
- problems in artificial intelligence
- convex optimization problems
- significant improvement
- computational problems
- approximate solutions
- np complete problems
- np complete
- related problems
- bilevel programming
- computational geometry
- discrete optimization
- computational complexity
- convex functions
- convergence rate
- data mining
- practical problems
- learning algorithm