constraint satisfaction dual problem (Q5164380)

From Wikidata
Jump to: navigation, search
a reformulation of a constraint satisfaction problem expressing each constraint of the original problem as a variable. Dual problems only contain binary constraints, and are therefore solvable by algorithms tailored for such problems
edit
Language Label Description Also known as
English
constraint satisfaction dual problem
a reformulation of a constraint satisfaction problem expressing each constraint of the original problem as a variable. Dual problems only contain binary constraints, and are therefore solvable by algorithms tailored for such problems

    Statements

     
    edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit