Technical reports

Joint publications (involving members of different network nodes) are identified by the European flag

	[1]	L. Bianchi, M. Birattari, M. Chiarandini, M. Manfrin, M. Mastrolilli, L. Paquete, and O. Rossi-Doria. Research on the vehicle routing problem with stochastic demand. Technical Report IDSIA-07-04, IDSIA, Manno, Switzerland, 2004. [ bib ]
	[2]	L. Bianchi and A. M. Campbell. Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem. Technical Report IDSIA-01-04, IDSIA, Manno, Switzerland, January 2004. Submitted to Operations Research Letters. [ bib ]
	[3]	M. Birattari. The race package for R. Racing methods for the selection of the best. Technical Report TR/IRIDIA/2003-37, IRIDIA, Université Libre de Bruxelles, Belgium, Brussels, Belgium, 2003. [ bib ]
	[4]	M. Birattari. On the estimation of the expected performance of a metaheuristic on a class of instances. How many instances, how many runs? Technical Report TR/IRIDIA/2004-01, IRIDIA, Université Libre de Bruxelles, Belgium, Brussels, Belgium, 2004. [ bib ]
	[5]	M. Birattari, G. Di Caro, and M. Dorigo. For a formal foundation of the ant programming approach to combinatorial optimization. part 1: The problem, the representation, and the general solution strategy. Technical Report TR-H-301, ATR-Human Information Processing Labs, Kyoto, Japan, 2000. [ bib ]
	[6]	C. Blum and M. Dorigo. Deception in ant colony optimization. Part I: Definition and examples. Technical Report TR/IRIDIA/2003-18, IRIDIA, Université Libre de Bruxelles, Belgium, 2003. [ bib ]
	[7]	C. Blum and M. Dorigo. Deception in ant colony optimization. Part II: Avoiding second order deception. Technical Report TR/IRIDIA/2003-19, IRIDIA, Université Libre de Bruxelles, Belgium, 2003. [ bib ]
	[8]	C. Blum, M. Sampels, M. Mastrolilli, and O. Rossi-Doria. Metaheuristics approaches for group shop scheduling. Technical Report TR/IRIDIA/2003-08, IRIDIA, Université Libre de Bruxelles, Belgium, 2003. [ bib ]
	[9]	M. Chiarandini, I. Dumitrescu, L. Paquete, and T. Stützle. A comparison of approximate algorithms for the graph colouring problem. Technical Report AIDA-04-00, FG Intellektik, FB Informatik, TU Darmstadt, Germany, 2004. [ bib ]
	[10]	M. Chiarandini, I. Dumitrescu, L. Paquete, and T. Stützle. Local search for the graph colouring problem: a formal study. Technical Report AIDA-04-01, FG Intellektik, FB Informatik, TU Darmstadt, Germany, 2004. [ bib ]
	[11]	M. Chiarandini, I. Dumitrescu, and T. Stützle. Local search for the colouring graph problem. A computational study. Technical Report AIDA-03-01, FG Intellektik, FB Informatik, TU Darmstadt, Germany, 2003. [ bib | .pdf ]
	[12]	M. Chiarandini L. Paquete and T. Stützle. A Study of Local Optima for the Biobjective Traveling Salesman Problem. Technical Report AIDA-2002-07, FG Intellektik, FB Informatik, TU Darmstadt, Germany, 2002. [ bib ]
	[13]	M. Chiarandini, K. Socha, M. Birattari, and O. Rossi-Doria. International timetabling competition. A hybrid approach. Technical Report AIDA-2003-04, FG Intellektik, FB Informatik, TU Darmstadt, Germany, 2003. [ bib | .pdf ]
	[14]	M. Chiarandini and T. Stützle. Experimental Evaluation of Course Timetabling Algorithms. Technical Report AIDA-02-05, FG Intellektik, FB Informatik, TU Darmstadt, Germany, 2002. [ bib | .pdf ]
	[15]	M. Chiarandini and T. Stützle. A landscape analysis for an hybrid algorithm on timetabling problem. Technical Report AIDA-03-05, FG Intellektik, FB Informatik, TU Darmstadt, Germany, 2003. [ bib | .pdf ]
	[16]	I. Dumitrescu and T. Stützle. A survey of methods that combine local search and exact algorithms. Technical Report AIDA-03-07, FG Intellektik, FB Informatik, TU Darmstadt, Germany, 2003. Submitted to EJOR. [ bib | .pdf ]
	[17]	M. Mastrolilli and L.M. Gambardella. Understanding local search heuristics for MAX-SAT. Technical Report IDSIA-13-02, IDSIA, Lugano, Switzerland, 2002. [ bib ]
	[18]	L. Paquete, M. Chiarandini, and T. Stützle. A study of local optima in the multiobjective travelling salesman problem. Technical Report AIDA-02-07, FG Intellektik, FB Informatik, TU Darmstadt, Germany, 2002. Presented at the Multiobjective Metaheuristics Workshop (MOMH 2002) , Paris, 4-5 November, 2002. [ bib ]
	[19]	L. Paquete and T. Stützle. Fast stochastic local searches for the biobjective quadratic assignment problem. Technical Report AIDA-2003-02, FG Intellektik, FB Informatik, TU Darmstadt, Germany, 2003. [ bib ]
	[20]	C. Piscopo and M. Birattari. Probability theory and intrinsically non-stochastic phenomena in AI: How to reject a metaphysical issue. Technical Report AIDA-2002-04, FG Intellektik, FB Informatik, TU Darmstadt, Germany, 2002. [ bib | .ps.gz | .pdf ]
	[21]	B. Rekiek, A. Delchambre, and H. A. Saleh. Pickup and delivery problems: An application of the grouping genetic algorithms. Submitted to the Journal of Mathematical Modelling and Algorithms. [ bib ]
	[22]	A. Roli and M. Dorigo. Metaheuristics for the max-sat problems. Technical Report TR/IRIDIA/2001-08, IRIDIA, Université Libre de Bruxelles, Belgium, 2001. [ bib ]
	[23]	O. Rossi-Doria and B. Paechter. An hyperheuristic approach to course timetabling problem using evolutionary algorithm. Technical report, Napier University, Edinburgh, Scotland, 2003. [ bib | .pdf ]
	[24]	O. Rossi-Doria and B. Paechter. A memetic algorithm for university course timetabling. Technical report, Napier University, Edinburgh, UK, 2004. Submitted to Discrete Applied Mathematics. [ bib | .pdf ]
	[25]	O. Rossi-Doria and B. Paechter. An opinion algorithm for university course timetabling. Technical report, Napier University, Edinburgh, UK, 2004. [ bib | .pdf ]
	[26]	H. A. Saleh. The influence of pheromone updating strategy of ant colony optimization in designing the global navigation satellite system positioning networks. Submitted to Artificial Intelligence. [ bib ]
	[27]	H. A. Saleh and S. Fidanova. Various local search procedures for improving the functionality of metaheuristic techniques in optimising the global positioning system (gps) networks. Submitted to the Journal of the Operational Reserach Society (ORS), UK. [ bib ]
	[28]	T. Schiavinotto and T. Stützle. The linear ordering problem: Instances, search space analysis and algorithm. Technical Report AIDA-2003-03, FG Intellektik, FB Informatik, TU Darmstadt, Germany, 2003. [ bib ]
	[29]	T. Stützle, H. Hoos, and A. Roli. A review of the literature on local search algorithms for MAX-SAT. Technical Report AIDA-01-02, FG Intellektik, FB Informatik, TU Darmstadt, Germany, 2001. [ bib | .pdf ]
	[30]	T. Stützle and M. Dorigo. Local search and metaheuristics for the quadratic assignment problem. Technical Report AIDA-01-01, FG Intellektik, FB Informatik, TU Darmstadt, Germany, 2001. [ bib | .pdf ]
	[31]	H. ten Eikelder and A. Liekens. First order parallel shop scheduling problems. Technical report, COG, Eindhoven University of Technology, 2001. [ bib ]
	[32]	M. Zlochin, M. Birattari, and M. Dorigo. Towards a theory of practice in metaheuristics design. A machine learning perspective. Technical Report Technical Report MCS04-01, Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot, Israel, 2004. [ bib ]