Title of article
An efficient algorithm for a class of constraint satisfaction problems
Author/Authors
Gerhard J. Woeginger، نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی سال 2002
Pages
8
From page
9
To page
16
Keywords
Constraint satisfaction , Feasibility checking , E cient algorithm , Satis , Horn formula , Graphhomomorphism , Monotone integer programming , AND=OR project scheduling , ability , graph coloring
Journal title
Operations Research Letters
Serial Year
2002
Journal title
Operations Research Letters
Record number
137336
Link To Document