Landscape analysis and efficient metaheuristics for solving the n-queens problem
DOI10.1007/S10589-013-9578-ZzbMATH Open1287.90057OpenAlexW1968921752WikidataQ60691973 ScholiaQ60691973MaRDI QIDQ2636616FDOQ2636616
Hossein Akbaripour, Nasrin Mohabbati-Kalejahi, Ellips Masehian
Publication date: 30 January 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9578-z
Recommendations
- Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems
- Fast search algorithms for the n-queens problem
- Complexity of \(n\)-queens completion
- Solving the \(N\)-Queens problem using hyperbrid genetic algorithm
- Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
simulated annealinglocal searchparameter tuningscatter searchTOPSIS method\(n\)-queens problemfitness analysis of landscape
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Optimization by Simulated Annealing
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiple attribute decision making. Methods and applications. A state-of- the-art survey
- Context-independent scatter and tabu search for permutation problems
- Title not available (Why is that?)
- Scatter search. Methodology and implementation in C. With CD-ROM.
- A survey of known results and research areas for \(n\)-queens
- A comparison of simulated annealing cooling strategies
- New decision rules for exact search in \(N\)-queens
- An almost perfect heuristic for the N nonattacking queens problem
- A dynamic programming solution to the \(n\)-queens problem
- Title not available (Why is that?)
Cited In (4)
- Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
- Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems
- An analytical evidence for Kalé's heuristic for the \(N\) queens problem
- Solving the \(N\)-Queens problem using hyperbrid genetic algorithm
Uses Software
This page was built for publication: Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2636616)
