Finding the Right Hybrid Algorithm - A Combinatorial Meta-Problem

Electronic Notes in Discrete Mathematics

Volumn 4, Issue , 2000, Pages 55-67

  Schimpf, Joachim ^a   Wallace, Mark ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34247400752     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/S1571-0653(05)80106-4     Document Type: Article

References (14)

1. Minton S. Automatically Configuring Constraint satisfaction Problems: A Case Study. Constraints 1 (1996) 7-44
2. Y. Caseau, F. Laburthe and G. Silverstein, A Meta-Heuristic Factory for Vehicle Routing Problems, in Proc. CPJ99 (Washington DC, 1999).
3. Y. Caseau, F. Laburthe, SALSA: A Language for Search Algorithms, in Proc. CP'98 (Pisa, 1998) 310-324.
4. Van Hentenryck P. The OPL Optimization Programming Language (1999), MIT Press
5. H. El Sakkout, M. Wallace and E. Richards, An Instance of Adaptive Propagation, in Proc. CP'96 (Boston, 1996).
6. R. Rodosek and M. Wallace, A Generic Model and Hybrid Algorithm for Hoist Scheduling Problems, in Proc. CP'98 (Pisa, 1998).
7. E.T. Richards and E.B. Richards, Non-systematic Search and Learning: An Empirical Study, in Proc. CP'98 (Pisa, 1998).
8. J. Schimpf, K. Shen and M. Wallace, Tutorial on Search in ECLiPSe, www.icparc.ic.ac.uk/eclipse Manuals and other documentation, 1999.
9. Minton S., Juhnstone M., Philips A., and Laird P. Minimizing Conflicts: a Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems. Artificial Intelligence 58 (1992) 161-206
10. L. Michel and P. Van Hentenryck, Localizer a Modelling Language for Local Search in Proc. CP'97 (Linz, 1997).
11. B. Selman and H. Kautz, An Empirical Study of Greedy Local Search for Satisfiability Testing, in AAAI-93, (1993) 46-51.
12. H. El Sakkout and M. Wallace, Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling, Constraints. Special issue on constraint-directed reasoning issues arising from industrial scheduling problems (To Appear).
13. A. van Gelder and Y. Tsuji, Instances from circuit fault analysis, http://aida.intellektik.informatik.tu-darmstadt.de/~hoos/SATLIB/Benchmar ks/SAT/DIMACS/BF/descr.html0
14. Chu Min Li and Anbulagan, Look-ahead versus Look-back for Satisfiability Problems, in Proc. CP'97, (Linz, 1997).