DM811 - Heuristics for Combinatorial Optimization

• [B1] W. Michiels, E. Aarts and J. Korst. Theoretical Aspects of Local Search. Springer Berlin Heidelberg, 2007

Books:

• [B2] S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. (Part II, chp. 3,4,6). Third Edition. Prentice Hall, 2010.
• [B3] P.V. Hentenryck and L. Michel. Constraint-Based Local Search. The MIT Press, Cambridge, USA, 2005. (In BlackBoard)
• [B4] H. Hoos and T. Stuetzle, Stochastic Local Search: Foundations and Applications, 2005, Morgan Kaufmann
• [B5] E.K. Burke, G. Kendal, Search methodologies: introductory tutorials in optimization and decision support techniques 2005, Springer, New York
• [B6] M. de Berg, O. Cheong, M. van Kreveld and M. Overmars. Chapter 5: Orthogonal Range Searching. Computational Geometry, Springer Berlin Heidelberg, 2008 , 95-120
• [B7] D.E. Knuth, T. Larrabee and P.M. Roberts. Mathematical writing. Mathematical Association of America, 1989

Articles:

• [A1] D.P. Bertsekas, J.N. Tsitsiklis and C. Wu. Rollout Algorithms for Combinatorial Optimization. Journal of Heuristics, 1997, 3(3), 245-262
• [A2] P.S. Ow and T.E. Morton. Filtered beam search in scheduling. International Journal of Production Research, 1988, 26(1) , 35-62
• [A3] J.J. Bentley. Fast Algorithms for Geometric Traveling Salesman Problems. ORSA Journal on Computing, 1992, vol. 4, issue 4, pp. 387-411.
• [A4] H.H. Hoos and E. Tsang. Local Search Methods. Chapter 5, In F. Rossi, P.V. Beek and T. Walsh (ed.). Handbook of Constraint Programming, Elsevier, 2006 (In BlackBoard)
• [A5] P. Hansen and N. Mladenovic Variable Neighborhood Search: Principles and Applications (2001) European Journal of Operational Research, 130(3), 449–467.

• [A6] C. Reeves. Genetic Algorithms. Chp. 3 In F. Glover and G. Kochenberger (eds.). Handbook of Metaheuristics, Kluwer Academic Publishers, Norwell, MA, USA, 2002, 57, 55-82 (In BlackBoard)

• [A7] T. Schiavinotto and T. Stuetzle. A review of metrics on permutations for search landscape analysis. Computers & Operations Research, 2007, 34(10), 3143-3153

• [A8] R.K. Ahuja, O. Ergun, J.B. Orlin and A.P. Punnen. A survey of very large-scale neighborhood search techniques Discrete Applied Mathematics, Volume 123, Issues 1-3, 15 November 2002, Pages 75-102

• [A9] M. Birattari, T. Stuetzle, L. Paquete, K. Varrentrapp (2002). A racing algorithm for configuring metaheuristics. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2002), pp. 11-18, Morgan Kaufmann Publishers, New York.

• [A10] Kernighan, B. & Lin, S. An Efficient Heuristic Procedure for Partitioning Graphs Bell System Technical Journal, 1970, 49, 291-307

• [A11] Lin, S. & Kernighan, B. W. An Effective Heuristic Algorithm for the Traveling Salesman Problem Operations Research, 1973, 21, 498-516

• [L1] A compendium of NP optimization problems
• [L2] M. Chiarandini. R notes.
• [L3] Local information on R

• [L4] Manual for Unix shell utilities useful for parsing and other file managing
• [L5] Timer for Java
• [L6] API for parsing command line options in Java
• [L7] Control and profiling of threads in Java
• [L8] Gprof for C and C++: instructions
• [L9] C++ reference
• [L10] Open Data Structures

• Comment list

• Fall 2008
  • answer model 1. Comments.
  • answer model 2. Comments.
  • answer model 3. Comments.