How Many Clues To Give? A Bilevel Formulation For The Minimum Sudoku Clue Problem.

Gennesaret Tjusila Mathieu Besançon Mark Turner Thorsten Koch

Published in: CoRR (2023)

Keyphrases

linear programming
minimum cost
set theoretic
database
parallel search
square error
information systems
feature selection
case study
image sequences
convex optimization
lower level
semidefinite programming
bi objective
convex relaxation
probabilistic formulation