Algorithm selection for combinatorial search problems: A survey

AI Magazine

Volumn 35, Issue 3, 2014, Pages 48-60

  Kotthoff, Lars ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; SURVEYS;

ALGORITHM FOR SOLVING; ALGORITHM SELECTION; COMBINATORIAL SEARCH; PROBLEM INSTANCES;

PROBLEM SOLVING;

EID: 84902498817     PISSN: 07384602     EISSN: None     Source Type: Journal    
DOI: 10.1609/aimag.v35i3.2460     Document Type: Review

References (58)

1. Aha, D. W. 1992. Generalizing from Case Studies: A Case Study. In Proceedings of the 9th International Workshop on Machine Learning, 1-10. San Francisco, CA: Morgan Kaufmann Publishers Inc.
2. Allen, J. A., and Minton, S. 1996. Selecting the Right Heuristic Algorithm: Runtime Performance Predictors. In Proceedings of the 11th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, 41-53. Berlin: Springer-Verlag.
3. Arbelaez, A.; Hamadi, Y.; and Sebag, M. 2009. Online Heuristic Selection in Constraint Programming. Paper presented at the Symposium on Combinatorial Search, Lake Arrowhead, CA, July 8-10.
4. Beck, J. C., and Freuder, E. C. 2004. Simple Rules for Low-Knowledge Algorithm Selection. In Proceedings of the First International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 50-64. Berlin: Springer. dx.doi.org/10.1007/978-3-540-24664-0-4
5. Borrett, J. E.; Tsang, E. P. K.; and Walsh, N. R. 1996. Adaptive Constraint Satisfaction: The Quickest First Principle. In Proceedings of the 12th European Conference on Artificial Intelligence (ECAI), 160-164. Chichester, UK: John Wiley and Sons.
6. Brodley, C. E. 1993. Addressing the Selective Superiority Problem: Automatic Algorithm/Model Class Selection. In Proceedings of the International Conference on Machine Learning, 17-24. San Francisco: Morgan Kaufmann Publishers, Inc.
7. Carbonell, J.; Etzioni, O.; Gil, Y.; Joseph, R.; Knoblock, C.; Minton, S.; and Veloso, M. 1991. Prodigy: An Integrated Architecture for Planning and Learning. SIGART Bulletin 2(2): 51-55. dx.doi.org/10.1145/122344.122353
8. Carchrae, T., and Beck, J. C. 2004. Low-Knowledge Algorithm Control. In Proceedings of the 19th National Conference on Artificial Intelligence, 49-54. Palo Alto, CA: AAAI Press.
9. Caseau, Y.; Laburthe, F.; and Silverstein, G. 1999. A Meta-Heuristic Factory for Vehicle Routing Problems. In Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming, 144-158. Berlin: Springer-Verlag.
10. Cook, D. J., and Varnell, R. C. 1997. Maximizing the Benefits of Parallel Search Using Machine Learning. In Proceedings of the 14th National Conference on Artificial Intelligence, 559-564. Palo Alto, CA: AAAI Press.
11. Demmel, J.; Dongarra, J.; Eijkhout, V.; Fuentes, E.; Petitet, A.; Vuduc, R.; Whaley, R. C.; and Yelick, K. 2005. Self-Adapting Linear Algebra Algorithms and Software. In Proceedings of the IEEE 93(2): 293-312. dx.doi.org/10.1109/JPROC. 2004.84084
12. Epstein, S. L., and Freuder, E. C. 2001. Collaborative Learning for Constraint Solving. In Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, 46-60. Berlin: Springer-Verlag.
13. Fink, E. 1997. Statistical Selection Among Problem-Solving Methods. Technical Report CMU-CS-97-101, Carnegie Mellon University, Pittsburgh, PA.
14. Fukunaga, A. S. 2008. Automated Discovery of Local Search Heuristics for Satisfiability Testing. Evolutionary Computation 16: 31-61.
15. Fukunaga, A. S. 2002. Automated Discovery of Composite SAT Variable-Selection Heuristics. In Proceedings of the 18th National Conference on Artificial Intelligence, 641-648. Menlo Park, CA: AAAI Press. dx.doi.org/10.1162/evco.2008.16. 1.31
16. Gagliolo, M., and Schmidhuber, J. 2008. Towards Distributed Algorithm Portfolios. In International Symposium on Distributed Computing and Artificial Intelligence, Advances In Soft Computing. Berlin: Springer.
17. Gagliolo, M., and Schmidhuber, J. 2006. Learning Dynamic Algorithm Portfolios. Annals of Mathematics and Artificial Intelligence 47(3-4): 295-328. dx.doi.org/10.1007/s10472-006-9036-z
18. Gent, I.; Jefferson, C.; Kotthoff, L.; Miguel, I.; Moore, N.; Nightingale, P.; and Petrie, K. 2010. Learning When To Use Lazy Learning In Constraint Solving. In Proceedings of the 19th European Conference on Artificial Intelligence, 873-878. Amsterdam, The Netherlands: IOS Press.
19. Gomes, C. P., and Selman, B. 1997. Algorithm Portfolio Design: Theory Versus Practice. In Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, 190-197. San Francisco: Morgan Kaufmann Publishers.
20. Guerri, A., and Milano, M. 2004. Learning Techniques for Automatic Algorithm Portfolio Selection. In Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 475-479. Amsterdam, The Netherlands: IOS Press.
21. Haim, S., and Walsh, T. 2009. Restart Strategy Selection Using Machine Learning Techniques. In Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing, 312-325. Berlin: Springer-Verlag.
22. Hong, L., and Page, S. E. 2004. Groups of Diverse Problem Solvers can Outperform Groups of High-Ability Problem Solvers. In Proceedings of the National Academy of Sciences of the United States of America 101(46): 16385-16389. dx.doi.org/10.1073/pnas.0403723101
23. Horvitz, E.; Ruan, Y.; Gomes, C. P.; Kautz, H. A.; Selman, B.; and Chickering, D. M. 2001. A Bayesian Approach To Tackling Hard Computational Problems. In Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, 235-244. San Francisco: Morgan Kaufmann Publishers Inc.
24. Huberman, B. A.; Lukose, R. M.; and Hogg, T. 1997. An Economics Approach to Hard Computational Problems. Science 275(5296): 51-54. dx.doi.org/10.1126/science.275.5296.51
25. Kadioglu, S.; Malitsky, Y.; Sabharwal, A.; Samulowitz, H.; and Sellmann, M. 2011. Algorithm Selection and Scheduling. In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Sciencem 454-469. Berlin: Springer.
26. Kadioglu, S.; Malitsky, Y.; and Sellmann, M. 2012. Non-Model-Based Search Guidance for Set Partitioning Problems. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence. Palo Alto, CA: AAAI Press.
27. Kadioglu, S.; Malitsky, Y.; Sellmann, M.; and Tierney, K. 2010. ISAC - Instance-Specific Algorithm Configuration. In Proceedings of the 19th European Conference on Artificial Intelligence, 751-756. Amsterdam, The Netherlands: IOS Press.
28. Kotthoff, L. 2012. Hybrid Regression-Classification Models for Algorithm Selection. In Proceedings of the 20th European Conference on Artificial Intelligence, 480-485. Amsterdam, The Netherlands: IOS Press.
29. Kotthoff, L.; Gent, I. P.; and Miguel, I. 2012. An Evaluation of Machine Learning in Algorithm Selection for Search Problems. AI Communications 25(3): 257-270.
30. Lagoudakis, M. G., and Littman, M. L. 2000. Algorithm Selection Using Reinforcement Learning. In Proceedings of the 17th International Conference on Machine Learning, 511-518. San Francisco: Morgan Kaufmann Publishers Inc.
31. Langley, P. 1983. Learning Search Strategies Through Discrimination. International Journal of Man-Machine Studies 18(6): 513-541. dx.doi.org/10.1016/S0020-7373(83)80030-
32. Leyton-Brown, K.; Nudelman, E.; and Shoham, Y. 2002. Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions. In Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming, 556-572. Berlin: Springer-Verlag.
33. Lobjois, L., and Lemaître, M. 1998. Branch and Bound Algorithm Selection by Performance Prediction. In Proceedings of the 15th National Conference on Artificial Intelligence, 353-358. Menlo Park, CA: AAAI Press.
34. Malitsky, Y.; Sabharwal, A.; Samulowitz, H.; and Sellmann, M. 2013. Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence. Palo Alto, CA: AAAI Press.
35. Minton, S. 1996. Automatically Configuring Constraint Satisfaction Programs: A Case Study. Constraints 1(1-2): 7-43. dx.doi.org/10.1007/BF00143877
36. Nikolic, M.; Maric, F.; and Janicic, P. 2009. Instance-Based Selection of Policies for SAT Solvers. In Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing, SAT '09, 326-340. Berlin: Springer-Verlag.
37. O'Mahony, E.; Hebrard, E.; Holland, A.; Nugent, C.; and O'Sullivan, B. 2008. Using Case-Based Reasoning in an Algorithm Portfolio for Constraint Solving. In Proceedings of the 19th Irish Conference on Artificial Intelligence and Cognitive Science. Lecture Notes in Computer Science. Berlin: Springer.
38. Petrik, M. 2005. Statistically Optimal Combination of Algorithms. Paper presented at the 31st Conference on Current Trends in Theory and Practice of Computer Science. Liptovsky Jan, Slovakia, January 22-28.
39. Pulina, L., and Tacchella, A. 2009. A Self-Adaptive Multi-Engine Solver for Quantified Boolean Formulas. Constraints 14(1): 80-116.
40. Pulina, L., and Tacchella, A. 2007. A Multi-Engine Solver for Quantified Boolean Formulas. In Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, 574-589. Berlin: Springer. dx.doi.org/10.1007/s10601-008-9051-2
41. Rice, J. R. 1976. The Algorithm Selection Problem. Advances in Computers 15: 65-118. dx.doi.org/10.1016/S0065-2458(08)60520-3
42. Roberts, M., and Howe, A. E. 2006. Directing A Portfolio With Learning. Paper presented at the AAAI 2006 Workshop on Learning for Search, Boston, MA, July 16.
43. Sakkout, H. E.; Wallace, M. G.; and Richards, E. B. 1996. An Instance of Adaptive Constraint Propagation. In Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, 164-178. Berlin: Springer Verlag.
44. Samulowitz, H., and Memisevic, R. 2007. Learning to Solve QBF. In Proceedings of the 22nd National Conference on Artificial Intelligence, 255-260. Palo Alto, CA: AAAI Press.
45. Silverthorn, B., and Miikkulainen, R. 2010. Latent Class Models for Algorithm Portfolio Methods. In Proceedings of the 24th AAAI Conference on Artificial Intelligence. Palo Alto, CA: AAAI Press.
46. Smith-Miles, K. A. 2008. Cross-Disciplinary Perspectives on Meta-Learning for Algorithm Selection. ACM Computing Surveys 41(1), Article 6. dx.doi.org/10.1145/1456650.1456656
47. Stergiou, K. 2009. Heuristics for Dynamically Adapting Propagation In Constraint Satisfaction Problems. AI Communications 22(3): 125-141.
48. Streeter, M. J.; Golovin, D.; and Smith, S. F. 2007. Combining Multiple Heuristics Online. In Proceedings of the 22nd National Conference on Artificial Intelligence, 1197-1203. Palo Alto, CA: AAAI Press.
49. Vrakas, D.; Tsoumakas, G.; Bassiliades, N.; and Vlahavas, I. 2003. Learning Rules for Adaptive Planning. In Proceedings of the 13th International Conference on Automated Planning and Scheduling, 82-91. Menlo Park, CA: AAAI Press.
50. Weerawarana, S.; Houstis, E. N.; Rice, J. R.; Joshi, A.; and Houstis, C. E. 1996. Pythia: A Knowledge-Based System to Select Scientific Algorithms. ACM Transactions on Mathematical Software 22(4): 447-468. dx.doi.org/10.1145/235815. 235820
51. Wolpert, D. H., and Macready, W. G. 1997. No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation 1(1): 67-82. dx.doi.org/10.1109/4235. 585893
52. Xu, L.; Hutter, F.; Hoos, H. H.; and Leyton-Brown, K. 2012. Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors. In Proceedings of the 15th International Conference on Theory and Applications of Satisfiability Testing (SAT'12), Lecture Notes in Computer Science 228-241. Berlin: Springer.
53. Xu, L.; Hutter, F.; Hoos, H. H.; and Leyton-Brown, K. 2011. Hydra-Mip: Automated Algorithm Configuration and Selection for Mixed Integer Programming. Paper presented at the RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion at the International Joint Conference on Artificial Intelligence, Barcelona, Spain, July 16.
54. Xu, L.; Hoos, H. H.; and Leyton-Brown, K. 2010. Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. In Proceedings of the 24th Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 210-216. Palo Alto, CA: AAAI Press.
55. Xu, L.; Hutter, F.; Hoos, H. H.; and Leyton-Brown, K. 2009. SATzilla2009: An Automatic Algorithm Portfolio for SAT. Paper presented at the 2009 SAT Competition, Swansea, Wales, UK, 30 June - 3 July.
56. Xu, L.; Hutter, F.; Hoos, H. H.; and Leyton-Brown, K. 2008. SATzilla: Portfolio-Based Algorithm Selection for SAT. Journal of Artificial Intelligence Research 32: 565-606.
57. Xu, L.; Hoos, H. H.; and Leyton-Brown, K. 2007. Hierarchical Hardness Models for SAT. In Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, 696-711. Berlin: Springer
58. Yun, X., and Epstein, S. L. 2012. Learning Algorithm Portfolios for Parallel Execution. In Proceedings of the 6th International Conference Learning and Intelligent Optimisation Lion, 323-338. Berlin: Springer.