Stochastic offline programming

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2009, Pages 784-791

  Malitsky, Yuri ^a   Sellmann, Meinolf ^a  

^a Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE-CASE; COMBINATORIAL ALGORITHM; OFF LINE PROGRAMMING; OFF-LINE LEARNING; OPTIMAL SOLUTIONS; SPECIFIC DISTRIBUTION;

ARTIFICIAL INTELLIGENCE; COMBINATORIAL MATHEMATICS; HEURISTIC ALGORITHMS; STOCHASTIC SYSTEMS;

LEARNING ALGORITHMS;

EID: 77949584736     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2009.23     Document Type: Conference Paper

References (16)

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. E. Balas and M. Carrera. A dynamic subgradient-based branch-and-bound procedure for set covering. Operations Research, 44:875-890, 1996.
3. R Battiti and G Tecchiolli. The reactive tabu search. ORSA Journal on Computing, 6(2):126-140, 1994.
4. M. Birattari, T. Stuetzle, L. Paquete, K. Varrentrapp. A Racing Algorithm for Configuring Metaheuristics. GECCO, 11-18, 2002.
5. J.A. Boyan and A.W. Moore. Learning Evaluation Functions to Improve Optimization by Local Search. Journal of Machine Learning Research, 1:77-112, 2000.
6. S.P. Coy, B.L. Golden, G.C. Runger, E.A. Wasil. Using Experimental Design to Find Effective Parameter Settings for Heuristics. Journal of Heuristics, 7(1):77-97, 2001.
7. A. Fukunaga. Automated discovery of local search heuristics for satisfiability testing. Evolutionary Computation, 16(1):31-61, 2008.
8. C. Gomes and B. Selman. Algorithm Portfolios. Artificial Intelligence, 126(1-2):43-62, 2001.
9. F. Hutter, H. Hoos, T. Stuetzle. Automatic Algorithm Configuration based on Local Search. AAAI, 1152-1157, 2007.
10. M. Jordan. Why the logistic function? A tutorial discussion on probabilities and neural networks. MIT Computational Cognitive Science Report, 9503:1995.
11. S.P. Lloyd. Least squares quantization in PCM. IEEE Transactions on Information Theory 28(2):129-137, 1982.
12. S. Minton. Automatically Configuring Constraint Satisfaction Programs. Constraints, 1(1):1-40, 1996.
13. E. Nudelman, K. Leyton-Brown, H.H. Hoos, A. Devkar, Y. Shoham. Understanding Random SAT: Beyond the Clauses-to-Variables Ratio. CP, 438-452, 2004.
14. J.E. Beasley. OR-Library. Journal of the Operational Research Society, 41(11):1069-1072, 1990.
15. Ph. Refalo. Impact-Based Search Strategies for Constraint Programming. CP, pp. 557-571, 2004.
16. R. Wunderling. Paralleler und objektorientierter Simplex-Algorithmus Technische Universität Berlin, 1996.