Simple rules for low-knowledge algorithm selection

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3011, Issue , 2004, Pages 50-64

  Beck, J Christopher ^a   Freuder, Eugene C ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPTIMIZATION; SCHEDULING; SCHEDULING ALGORITHMS;

ALGORITHM SELECTION; CONSTRAINT TECHNOLOGY; OPTIMIZATION TECHNOLOGY; PROBLEM INSTANCES; RUN LENGTH; SCHEDULING PROBLEM;

ALGORITHMS;

EID: 35048837571     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24664-0_4     Document Type: Article

References (18)

1. Rice, J.: The algorithm selection problem. Advances in Computers 15 (1976) 65-118
2. Leyton-Brown, K., Nudelman, E., Shoham, Y.: Learning the empirical hardness of optimization problems: The case of combinatorial auctions. In: Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP02). (2002) 556-572
3. Minton, S.: Automatically configuring constraint satisfaction programs: A case study. CONSTRAINTS 1 (1996) 7-43
4. Horvitz, E., Ruan, Y., Gomes, C., Kautz, H., Selman, B., Chickering, M.: A bayesian approach to tacking hard computational problems. In: Proceedings of the Seventeenth Conference on uncertainty and Artificial Intelligence (UAI-2001). (2001) 235-244
5. Kautz, H., Horvitz, E., Ruan, Y., Gomes, C., Selman, B.: Dynamic restart policies. In: Proceedings of the Eighteenth National Conference on Artifiical Intelligence (AAAI-02). (2002) 674-681
6. Ruan, Y., Horvitz, E., Kautz, H.: Restart policies with dependence among runs: A dynamic programming approach. In: Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP-2002), Springer-Verlag (2002) 573-586
7. Watson, J. P.: Empirical Modeling and Analysis of Local Search Algorithms for the Job-Shop Scheduling Problem. PhD thesis, Dept. of Computer Science, Colorado State University (2003)
8. Watson, J. P., Barbulescu, L., Whitley, L., Howe, A.: Constrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance. INFORMS Journal on Computing 14 (2002)
9. Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Management Science 42 (1996) 797-813
10. Beck, J. C., Fox, M. S.: Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artificial Intelligence 117 (2000) 31-81
11. Nuijten, W. P. M.: Time and resource constrained scheduling: a constraint satisfaction approach. PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology (1994)
12. Laborie, P.: Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. Artificial Intelligence 143 (2003) 151-188
13. Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. Information Processing Letters 47 (1993) 173-180
14. Scheduler: ILOG Scheduler 5.2 User's Manual and Reference Manual. ILOG, S. A. (2001)
15. Beck, J. C., Perron, L.: Discrepancy-bounded depth first search. In: Proceedings of the Second International Workshop on Integration of AI and OR Technologies for Combinatorial Optimization Problems (CPAIOR'00). (2000)
16. Cohen, P. R.: Empirical Methods for Artificial Intelligence. The MIT Press, Cambridge, Mass. (1995)
17. Beck, J. C., Refalo, P.: Combining local search and linear programming to solve earliness/tardiness scheduling problems. In: Proceedings of the Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'02). (2002)
18. Vazquez, M., Whitley, L. D.: A comparision of genetic algorithms for the dynamic job shop scheduling problem. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), Morgan Kaufmann (2000) 1011-1018