Glover F  Parker M   Ryan J 
& Trick, 1996) pp Coloring by tabu branch and bound  In (Johnson Gomes C Selman B
Boosting combinatorial search through ran Kautz  H
domization  In  Proceedings of AAAI-98  pp Johnson D S   Trick M A  Eds Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1996 Vol    of DIMACS Series in Discrete Mathematics and Theoretical Computer Science  American Mathematical Society Clements D
Joslin D
98 pp Squeaky wheel" optimization In Proceedings of AAAI-
Lewandowski G    Condon A
 Experiments with parallel graph coloring heuristics and applications of graph coloring  In (Johnson & Trick, 1996) pp Morgenstern C
Distributed coloration neighborhood search  In ( Johnson & Trick ,
1996) pp Walser   J
Tuning local search for satisfiability testing  In  Proceedings Parkes A
of AAAI-96 pp Rullier  F
sing tabu search for solving the resource Pinson E Prins C
constrained project seduling problem  In EURO-WG PMS 4 (EURO Working Group on Project Management and Scheduling) pp. 11 (1999)
Louvain  Belgium Selman B  Kautz H A    Cohen B
Local search strategies for satisfiability testing  In (Johnson & Trick, 1996) pp To Generation of schedules using a genetic procedure S Patent Syswerda G P
number