Research Article
Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems
Algorithm 1
Instance generation model B.
| (1) procedure MODELB(, , , ) | | (2) | | (3) GENERATECONSTRAINTGRAPH(, ); | | (4) for each edge in do | | (5) GENERATECONFLICTS(edge.from, edge.to, , ) | | (6) end for | | (7) end procedure | | (8) procedure GENERATECONSTRAINTGRAPH(, ) | | (9) | | (10) for = 0 to do | | (11) for = to do | | (12) CREATEEDGE(from = , to = ) | | (13) end for | | (14) end for | | (15) RANDOMSUBSET | | (16) end procedure | | (17) procedure GENERATECONFLICTS(, ) | | (18) | | (19) for each in do | | (20) for each in do | | (21) (, ) | | (22) end for | | (23) end for | | (24) RANDOMSUBSET(, ) | | (25) end procedure |
|