ISAC - Instance-specific algorithm configuration

Frontiers in Artificial Intelligence and Applications

Volumn 215, Issue , 2010, Pages 751-756

  Kadioglu, Serdar ^a   Malitsky, Yuri ^a   Sellmann, Meinolf ^a   Tierney, Kevin ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; STOCHASTIC SYSTEMS;

ALGORITHM CONFIGURATIONS; CONFIGURATION SYSTEM; CONTINUOUS PARAMETERS; FEATURES VECTOR; HIGH QUALITY; OFF LINE PROGRAMMING; PARAMETER-SETTING; PROGRAMMING PARADIGMS; QUALITY PARAMETERS; STOCHASTICS;

CONSTRAINED OPTIMIZATION;

EID: 77956044105     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-60750-606-5-751     Document Type: Conference Paper

References (35)

1. B. Adenso-Diaz and M. Laguna. Fine-tuning of Algorithms using Fractional Experimental Design and Local Search. Operations Research, 54(1):99-114, 2006.
2. C. A. Gil, M. Sellmann and K. Tierney. A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. CP 2009, Springer LNCS 5732, pp. 142-157, 2009.
3. M. Birattari, T. Stuetzle, L. Paquete and K. Varrentrapp, A Racing Algorithm for Configuring Metaheuristics. GECCO, 11-18, 2002.
4. A. Caprara, M. Fischetti, P. Toth, D. Vigo and P.L. Guida. Algorithms for Railway Crew Management. Mathematical Programming, 79:125-141, 1997.
5. S.P. Coy, B.L. Golden, G.C. Runger and E.A. Wasil. Using Experimental Design to Find Effective Parameter Settings for Heuristics. Journal of Heuristics, 7(1):77-97, 2001.
6. IBM. IBM CPLEX Reference manual and user manual. V12.1, IBM 2009.
7. M. Davis, G. Logemann, D. Loveland. A machine program for theoremproving. Commun. ACM, 5(7), 394-397, 1962.
8. A. Fukunaga, Automated discovery of local search heuristics for satisfiability testing. Evolutionary Computation, 16(1):31-61, 2008.
9. I. P. Gent, H. H. Hoos, P. Prosser and T.Walsh. Morphing: Combining Structure and Randomness. AAAI 99, 654-660, 1999.
10. C.P. Gomes and B. Selman. Problem Structure in the Presence of Perturbations. AAAI 97, 221-226, 1997.
11. C.P. Gomes, B. Selman. Algorithm Portfolios. Artificial Intelligence, 126(1- 2):43-62, 2001.
12. G. Hamerly and C. Elkan. Learning the K in K-Means. NIPS 2003.
13. E. Housos and T. Elmoth. Automatic Optimization of Subproblems in Scheduling Airline Crews. Interfaces, 27(5):68-77, 1997.
14. K.L. Hoffmann and M.W. Padberg. Solving Airline Crew Scheduling Problems by Branch-and-Cut. Management Science, 39(6):657-682, 1993.
15. F. Hutter and Y. Hamadi. Parameter Adjustment Based on Performance Prediction: Towards an Instance-Aware Problem Solver. Technical Report MSR-TR- 2005-2125, Microsoft Research Cambridge, UK, 2005.
16. F. Hutter, Y. Hamadi, H.H. Hoos and K. Leyton-brown. Performance prediction and automated tuning of randomized and parametric algorithms. CP 06, pp. 213-228, 2006.
17. F. Hutter, H.H. Hoos, K. Leyton-Brown and T. Stuetzle. ParamILS: An Automatic Algorithm Configuration Framework. JAIR Volume36, pages 267-306, 2009.
18. B. Huberman, R. Lukose and T. Hogg. An Economics Approach to Hard Computational Problems. Science, 265:51-54, 2003.
19. F. Hutter, D.A.D. Tompkins and H.H. Hoos. Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. CP 02, 233-248, 2002.
20. S. Kadioglu and M. Sellmann. Dialectic Search. CP 09, Springer LNCS 5732, 486-500, 2009.
21. K. Leyton-Brown, M. Pearson and Y. Shoham. Towards a universal test suite for combinatorial auction algorithms. Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), pp. 66-76, 2000.
22. L. Lobjois and M. Lematre. Branch and bound algorithm selection by performance prediction. AAAI 98, pp. 353-358, 1998.
23. Y. Malitsky and M. Sellmann. Stochastic Offline Programming. ICTAI 784-791, 2009.
24. S. Minton. Automatically Configuring Constraint Satisfaction Programs. Constraints, 1(1):1-40, 1996.
25. A. Saxena. MIP Benchmark Instances. http://www.andrew.cmu.edu/ user/anureets/mpsInstances.htm.
26. M. Motoki and R. Uehara. Unique solution instance generation for the 3- Satisfiability (3SAT) problem.In SAT 2000, pages 293-305.
27. N. Musliu. Local Search Algorithm for Unicost Set Covering Problem. IEA/AIE, 302-311, 2006.
28. M. Oltean. Evolving evolutionary algorithms using linear genetic programming. Evolutionary Computation, 13(3):387-410, 2005.
29. D. J. Patterson and H. Kautz. Auto-walksat: a self-tuning implementation of walksat. Electronic Notes in Discrete Mathematics, Volume 9, pp. 360-368, 2001.
30. M. Preuss and T. Bartz-Beielstein. Sequential Parameter Optimization Applied to Self-adaptation for Binary-coded Evolutionary Algorithms. Parameter Setting in Evolutionary Algorithms: Studies in Computational Intelligence, 91-119, 2007.
31. SAT Competition. http://www.satcomptition.org.
32. A. Slater. Modelling More Realistic SAT Problems. 15th Australian Joint Conference on Artificial Intelligence, LNAI 2557, pp. 291-602 2002.
33. C. Toregas, R. Swain, C. ReVelle and L. Bergman. The Location of Emergency Service Facilities. Operational Research, 19(6):1363-1373, 1971.
34. F.J. Vasko and F.E. Wolf. Optimal Selection of Ingot Sizes via Set Covering. Operations Research, 35:115-121, 1987.
35. L. Xu, F. Hutter, H. H. Hoos and K. Leyton-Brown. SATzilla: Portfolio-based Algorithm Selection for SAT. JAIR, Volume 32, pages 565-606, 2008.