2013/01/04 by Thomas Fischer, Fischer, Thomas
Engineering · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #G.1.6 #G.2.1 #Optimization and Control (math.OC) #Primary 49N15 #Secondary 90C46 91A46 90C10 #acm:49N15 #acm:90C10 #acm:90C46 #acm:91A46 #graph theory and CDMA systems #math.CO #math.OC #msc:49N15 #msc:90C10 #msc:90C46 #msc:91A46
paper · pdf · doi:10.48550/arxiv.1301.0790
12 pages, 1 figure
arxiv created 2013/01/04 · openalex publication_date 2013/01/04 · arxiv updated 2013/01/07 · openalex created_date 2024/04/10 · openalex updated_date 2026/07/28
We consider a mathematical model for the classical Sudoku puzzle, which we call the primal problem and introduce a corresponding dual problem. Both problems are constraint satisfaction models and a duality relation between them is proved. Based on these models, we introduce a primal and a dual optimization problem and show weak and strong duality properties.