1. A tabu search algorithm for the open shop problem;Alcaide;TOP (Trabajos de Investigación Operativa),1997
2. A computational study of the job-shop scheduling problem;Applegate;ORSA J. Comput.,1991
3. A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem;Bayardo,1996
4. Using CSP look-back techniques to solve exceptionally hard SAT instances;Bayardo,1996
5. Arc consistency in dynamic constraint satisfaction problems;Bessière,1991