Portfolio approaches for constraint optimization problems

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

Volumn 8426 LNCS, Issue , 2014, Pages 21-35

  Amadini, Roberto ^a   Gabbrielli, Maurizio ^a   Mauro, Jacopo ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINED OPTIMIZATION;

CONSTRAINT OPTIMIZATION PROBLEMS; CONSTRAINT SOLVERS; CONSTRAINTS SATISFACTION PROBLEM; EMPIRICAL EVALUATIONS; STATE OF THE ART;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84905855595     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-09584-4_3     Document Type: Conference Paper

References (39)

1. Amadini, R., Gabbrielli, M., Mauro, J.: An empirical evaluation of portfolios approaches for solving CSPs. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 316-324. Springer, Heidelberg (2013)
2. Amadini, R., Gabbrielli, M., Mauro, J.: SUNNY: a Simple and dynamic algorithm portfolio for solving CSPs. CoRR, abs/1311.3353 (2013)
3. Amadini, R., Gabbrielli, M., Jacopo M.: An Enhanced Features Extractor for a Portfolio of Constraint Solvers. In: SAC (2014)
4. Arlot, S., Celisse, A.: A survey of cross-validation procedures for model selection. Stat. Surv. 4, 40-79 (2010)
5. Baral, C.: Knowledge Representation Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
6. Becket, R.: Specification of FlatZinc - Version 1.6. http://www.minizinc. org/downloads/doc-1.6/flatzinc-spec.pdf
7. Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. IOS Press, Amsterdam (2009)
8. Borenstein, Y., Poli, R.: Kolmogorov complexity, Optimization and Hardness pp. 12-119. In Evolutionary Computation (2006)
9. Carchrae, T., Beck, J.C.: Applying machine learning to low-knowledge control of optimization algorithms. Comput. Intell. 21(4), 372-387 (2005)
10. CPX Discrete Optimiser. http://www.opturion.com/cpx.html
11. Third International CSP Solver Competition 2008. http://www.cril.univ- artois.fr/CPAI09/
12. Gomes, C.P., Selman, B.: Algorithm portfolios. Artif. Intell. 126(1-2), 43-62 (2001)
13. Gomes, C.P., Selman, B., Crato, N.: Heavy-tailed distributions in combinatorial search. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330. Springer, Heidelberg (1997)
14. Guo, H., Hsu, W.H.: A machine learning approach to algorithm selection for NP-hard optimization problems: a case study on the MPE problem. Ann. Oper. Res. 156(1), 61-82 (2007)
15. Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The WEKA data mining software: an update. SIGKDD Explor. Newsl. 11(1), 10-18 (2009)
16. Hoos, H.H., Kaufmann, B., Schaub, T., Schneider, M.: Robust benchmark set selection for boolean constraint solvers. In: Nicosia, G., Pardalos, P. (eds.) LION 7. LNCS, vol. 7997, pp. 138-152. Springer, Heidelberg (2013)
17. Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm Runtime Prediction: The State of the Art. CoRR, abs/1211.0906 (2012)
18. Kadioglu, S., Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm selection and scheduling. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 454-469. Springer, Heidelberg (2011)
19. Kadioglu, S., Malitsky, Y., Sellmann, M., Kevin T.: ISAC - Instance-specific algorithm configuration. In: ECAI (2010)
20. Knowles, J.D., Corne, D.W: Towards landscape analyses to inform the design of hybrid local search for the multiobjective quadratic assignment problem. In: HIS (2002)
21. Kotthoff, L.: Algorithm Selection for Combinatorial Search Problems: A Survey. CoRR, abs/1210.7959 (2012)
22. Kroer, C., Malitsky, Y.: Feature filtering for instance-specific algorithm configuration. In: ICTAI (2011)
23. Leyton-Brown, K., Nudelman, E., Shoham, Y.: The case of combinatorial auctions. In: CP, Learning the Empirical Hardness of Optimization Problems (2002)
24. Lobjois, L., Lemaître, M.: Branch and bound algorithm selection by performance prediction. In: AAAI/IAAI (1998)
25. Mackworth, A.K.: Consistency in networks of relations. Artif. Intell. 8(1), 99-118 (1977)
26. Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm portfolios based on cost-sensitive hierarchical clustering. In: IJCAI (2013)
27. Max-SAT 2013. http://maxsat.ia.udl.cat/introduction/
28. Merz, P.: Advanced fitness landscape analysis and the performance of memetic algorithms. Evol. Comput. 12(3), 303-325 (2004)
29. Minizinc version 1.6. http://www.minizinc.org/download.html
30. MiniZinc Challenge. http://www.minizinc.org/challenge2012/results2012. html
31. O'Mahony, E., Hebrard, E., Holland, A., Nugent, C., O'Sullivan, B.: Using case-based reasoning in an algorithm portfolio for constraint solving. In: AICS 08 (2009)
32. Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65-118 (1976)
33. SAT Challenge 2012. http://baldur.iti.kit.edu/SAT-Challenge-2012/
34. Smith-Miles, K.A.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41(1), 1-25 (2008)
35. Smith-Miles, K.A.: Towards insightful algorithm selection for optimisation using meta-learning concepts. In: IJCNN (2008)
36. Telelis, O., Stamatopoulos, P.: Combinatorial optimization through statistical instance-based learning. In: ICTAI (2001)
37. Xu, L., Hutter, F., Shen, J., Hoos, H., Leyton-Brown, K.: SATzilla2012: improved algorithm selection based on cost-sensitive classification models. In: SAT Challenge, Solver description (2012)
38. Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla-07: The design and analysis of an algorithm portfolio for SAT. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 712-727. Springer, Heidelberg (2007)
39. Xu, L., Hutter, F., Hoos, H.H., Leyton-brown, K.: Hydra-MIP: automated algorithm configuration and selection for mixed integer programming. In: RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (2011)