Chasing first queens by integer programming

DOI10.1007/978-3-319-93031-2_16MaRDI QIDQ1626730zbMATH OpenOpenAlexFDO

Authors Matteo Fischetti, Domenico Salvagnin

Publication date 21 November 2018

Full work available at URL https://arxiv.org/abs/1907.08246

zbMATH Keywords

lexicographic simplexmixed-integer programmingN-queens problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Recommendations

• A dynamic programming solution to the n-queens problem
• scientific article; zbMATH DE number 436080
• scientific article; zbMATH DE number 1743978
• On the queen domination problem
• Fast search algorithms for the n-queens problem
• A generalization of the n-queen problem
• An almost perfect heuristic for the N nonattacking queens problem
• scientific article; zbMATH DE number 1051284
• scientific article; zbMATH DE number 2190096

Cited in

(5)

• Leprechauns on the chessboard
• An Application of Graph Theory and Integer Programming: Chessboard Non-Attacking Puzzles
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Finding First and Most-Beautiful Queens by Integer Programming
• Complexity of chess domination problems

This page was built for publication: Chasing first queens by integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1626730)