Integer programming, including a Gomory-cut variant, yields new lex-first n-queens solutions for n=56-115 and min-max beautiful solutions for n<=176.
Odd cut-sets, odd cycles, and 0-1/2 Chvatal-Gomory cuts
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Finding First and Most-Beautiful Queens by Integer Programming
Integer programming, including a Gomory-cut variant, yields new lex-first n-queens solutions for n=56-115 and min-max beautiful solutions for n<=176.