An efficient algorithm for a class of constraint satisfaction problems

Gerhard J. Woeginger، نويسنده ,

دوماهنامه با شماره پیاپی سال 2002

8

9

16

Constraint satisfaction , Feasibility checking , E cient algorithm , Satis , Horn formula , Graphhomomorphism , Monotone integer programming , AND=OR project scheduling , ability , graph coloring

Operations Research Letters

2002

Operations Research Letters

137336