New decision rules for exact search in \(N\)-queens

DOI10.1007/s10898-011-9653-xzbMath1229.90171OpenAlexW2067988777MaRDI QIDQ652694

Pablo San Segundo

Publication date: 15 December 2011

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-011-9653-x

zbMATH Keywords

constraint satisfactionmaximum cliqueglobal search\(N\)-queensdecision heuristics

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem ⋮ Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems

Uses Software

• MINION

Cites Work

• An almost perfect heuristic for the N nonattacking queens problem
• A survey of known results and research areas for \(n\)-queens
• The average complexity of depth-first search with backtracking and cutoff
• Backtrack programming techniques
• PARALLEL MEMORY ALLOCATION AND DATA ALIGNMENT IN SIMD MACHINES
• Unnamed Item
• Unnamed Item

This page was built for publication: New decision rules for exact search in \(N\)-queens