
Conference publications
Conference publications
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, O. RossiDoria, and T. Schiavinotto.
Metaheuristics for the vehicle routing problem with stochastic
demands.
In Proceedings of PPSNVIII, Eighth International Conference on
Parallel Problem Solving from Nature, volume 3242 of Lecture
Notes in Computer Science, pages 450460. Springer Verlag, Berlin, Germany,
2004.
[ bib ]


[2]

L. Bianchi, L. M. Gambardella, and M. Dorigo.
An ant colony optimization approach to the probabilistic traveling
salesman problem.
In J.J. Merelo Guervós et al., editor, Proceedings of
PPSNVII, Seventh International Conference on Parallel Problem Solving from
Nature, volume 2439 of Lecture Notes in Computer Science, pages
883892. Springer Verlag, Berlin, Germany, 2002.
[ bib 
.ps.gz 
.pdf ]


[3]

L. Bianchi, L. M. Gambardella, and M. Dorigo.
Solving the homogeneous probabilistic traveling salesman problem by
the ACO metaheuristic.
In M. Dorigo, G. Di Caro, and M. Sampels, editors, Proceedings
of ANTS 2002  From Ant Colonies to Artificial Ants: Third International
Workshop on Ant Algorithms, volume 2463 of Lecture Notes in Computer
Science, pages 176187. Springer Verlag, Berlin, Germany, 2002.
[ bib 
.ps.gz 
.pdf ]


[4] 
M. Birattari, G. Di Caro, and M. Dorigo.
Toward a formal foundation of ant programming.
In M. Dorigo, G. Di Caro, and M. Sampels, editors, Proceedings of ANTS 2002
 From Ant Colonies to Artificial Ants: Third International Workshop on Ant
Algorithms, volume 2463 of Lecture Notes in Computer Science, pages
188201. Springer Verlag, Berlin, Germany, 2002.
[ bib  .ps.gz  .pdf ] 

[5]

M. Birattari, T. Stützle, L. Paquete, and K. Varrentrapp.
A racing algorithm for configuring metaheuristics.
In W.B. Langdon et al., editor, Proceedings of the Genetic and
Evolutionary Computation Conference (GECCO2002), pages 1118. Morgan
Kaufmann Publishers, San Mateo, CA, 2002.
Also available as: AIDA200201 Technical Report of Intellektik,
Technische Universität Darmstadt, Darmstadt, Germany.
[ bib 
.ps.gz 
.pdf ]


[6] 
M. J. Blesa and C. Blum. Ant colony optimization for the maximum edgedisjoint
paths problem. In G. R. Raidl et al., editor, Applications of Evolutionary
Computing, Proceedings of EvoWorkshops 2004, volume 3005 of Lecture
Notes in Computer Science, pages 160169. Springer Verlag, Berlin, Germany,
2004.
[ bib ] 

[7] 
C. Blum. ACO applied to group shop scheduling: A case study on intensification
and diversification. In M. Dorigo, G. Di Caro, and M. Sampels, editors, Proceedings
of ANTS 2002  From Ant Colonies to Artificial Ants: Third International
Workshop on Ant Algorithms, volume 2463 of Lecture Notes in Computer
Science, pages 1427. Springer Verlag, Berlin, Germany, 2002.
[ bib ] 

[8] 
C. Blum. Ant colony optimization for the edgeweighted kcardinality
tree problem. In W. B. Langdon, E. CantúPaz, K. Mathias, R. Roy,
D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L.
Bull, M. A. Potter, A. C. Schultz, J. F. Miller, E. Burke, and N. Jonoska,
editors, Proceedings of the Genetic and Evolutionary Computation Conference
(GECCO2002), pages 2734. Morgan Kaufmann Publishers, San Mateo, CA,
2002.
[ bib ] 

[9]

C. Blum, S. Correia, O. RossiDoria, M. Snoek, M. Dorigo, and B. Paechter.
A GA evolving instructions for a timetable builder.
In E. Burke and P. De Causmaecker, editors, Proceedings of PATAT
2002  Fourth International the Conference on Practice and Theory of
Automated Timetabling, pages 120123. KaHo SintLieven, Department of
Industrial Engineering, Gent, Belgium, 2002.
[ bib 
.ps 
.pdf ]


[10] 
C. Blum and M. Dorigo. Deception in ant colony optimization. In M. Dorigo,
M. Birattari, C. Blum, L. M. Gambardella, F. Mondada, and T. Stützle,
editors, Proceedings of ANTS 2004  Fourth International Workshop on Ant
Colony Optimization and Swarm Intelligence, volume 3172 of Lecture
Notes in Computer Science, pages 119130. Springer Verlag, Berlin, Germany,
2004.
[ bib ] 

[11] 
C. Blum, A. Roli, and M. Dorigo. HCACO: The hypercube framework for Ant
Colony Optimization. In Proceedings of the Fourth Metaheuristics International
Conference, volume 2, pages 399403, 2001.
[ bib ] 

[12] 
C. Blum and M. Sampels. Ant Colony Optimization for FOP Shop scheduling:
A case study on different pheromone representations. In Proceedings of
the 2002 Congress on Evolutionary Computation (CEC'02), volume 2, pages
15581563. IEEE Computer Society Press, Los Alamitos, CA, 2002.
[ bib  .ps  .pdf ] 

[13] 
C. Blum and M. Sampels. When model bias is stronger than selection pressure.
In J.J. Merelo Guervós et al., editor, Proceedings of PPSNVII,
Seventh International Conference on Parallel Problem Solving from Nature,
number 2439 in Lecture Notes in Computer Science, pages 893902. Springer
Verlag, Berlin, Germany, 2002.
[ bib ] 

[14] 
C. Blum, M. Sampels, and M. Zlochin. On a particularity in modelbased
search. In W. B. Langdon, E. CantúPaz, K. Mathias, R. Roy, D. Davis,
R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M.
A. Potter, A. C. Schultz, J. F. Miller, E. Burke, and N. Jonoska, editors, Proceedings
of the Genetic and Evolutionary Computation Conference (GECCO2002),
pages 3542, 2002.
[ bib ] 

[15] 
T. Bousonville. Local search and evolutionary computation for arc routing
in garbage collection. In L. Spector et al., editor, Proceedings of the
Genetic and Evolutionary Computation Conference (GECCO2001), pages 11371143.
Morgan Kaufmann Publishers, San Mateo, CA, 2001.
[ bib ] 

[16] 
T. Bousonville. The two stage continuous parallel flow shop problem with
limited storage: modeling and algorithms. In P. Collet et al., editor, Proceedings
of EA 2001  5th International Conference on Artificial Evolution, volume
2310 of Lecture Notes in Computer Science, pages 180191. Springer
Verlag, Berlin, Germany, 2002.
[ bib ] 

[17] 
M. Chiarandini and T. Stützle. An application of Iterated Local Search
to Graph Coloring. In D.S. Johnson, A. Mehrotra, and M. Trick, editors, Proceedings
of CP 2002  Eigth International Conference on Principles and Practice of
Constraints Programming, pages 112125, 2002.
[ bib  .pdf ] 

[18] 
M.L. den Besten and T. Stützle. Neighborhoods revisited: An experimental
investigation into the effectiveness of variable neighborhood descent for
scheduling. In Proceedings of the Fourth Metaheuristics International
Conference, volume 2, pages 545549, 2001.
[ bib  .ps  .pdf ] 

[19]

M. L. den Besten, T. Stützle, and M. Dorigo.
Design of iterated local search algorithms: An example application to
the single machine total weighted tardiness problem.
In E. J. W. Boers, J. Gottlieb, P. L. Lanzi, R. E. Smith, S. Cagnoni,
E. Hart, G. R. Raidl, and H. Tijink, editors, Applications of
Evolutionary Computing: Proceedings of EvoWorkshops 2001, volume 2037 of
Lecture Notes in Computer Science, pages 441452. Springer Verlag,
Berlin, Germany, 2001.
[ bib 
.pdf ]


[20] 
M. Dorigo. Ant algorithms solve difficult optimization problems. In J.
Kelemen, editor, Proceedings of the Sixth European Conference on Artificial
Life, volume 2159 of Lecture Notes in Artificial Intelligence,
pages 1122. Springer Verlag, Berlin, Germany, 2001.
[ bib  .pdf ] 

[21]

M. Dorigo and T. Stützle.
An experimental study of the simple ant colony optimization
algorithm.
In C.E. D'Attellis et al., editor, EC 2001: Proccedings of the
2001 WSES International Conference on Evolutionary Computation. WSESPress
International, 2001.
[ bib 
.ps.gz 
.pdf ]


[22]

M. Dorigo, M. Zlochin, N. Meuleau, and M. Birattari.
Updating ACO pheromones using stochastic gradient ascent and
crossentropy methods.
In S. Cagnoni et al., editor, Applications of Evolutionary
Computing, Proceedings of EvoWorkshops 2002, volume 2279 of Lecture
Notes in Computer Science, pages 2130. Springer Verlag, Berlin, Germany,
2002.
Also available as technical report TR/IRIDIA/200119, IRIDIA,
Université Libre de Bruxelles.
[ bib 
.pdf ]


[23] 
I. Dumitrescu and T. Stützle. Combinations of local search and exact
algorithms. In G. Raidl et al., editor, Applications of Evolutionary Computing,
Proceedings of EvoWorkshops 2003, number 2611 in Lecture Notes in Computer
Science, pages 211224. Springer Verlag, Berlin, Germany, 2003.
[ bib  .pdf ] 

[24] 
S. Fidanova. ACO Algorithm with Additional Reinforcement. In M. Dorigo,
G. Di Caro, and M. Sampels, editors, Proceedings of ANTS 2002  From Ant
Colonies to Artificial Ants: Third International Workshop on Ant Algorithms,
volume 2463 of Lecture Notes in Computer Science, pages 292293. Springer
Verlag, Berlin, Germany, 2002.
[ bib  .ps  .pdf ] 

[25] 
S. Fidanova. ACO Algorithm for MKP Using Different Heuristic Information.
In I. Dimov, I. Lirkov, S. Margenov, and Z. Zlatev, editors, Proceedings
of NM&A 2002  Fifth International Conference on Numerical Methods and
Applications, volume 2542 of Lecture Notes in Computer Science,
pages 438444. Springer Verlag, Berlin, Germany, 2003.
[ bib ] 

[26] 
S. Fidanova. Evolutionary Algorithm for Multiple Knapsack Problem. Proceedings
of PPSN VII Workshops 2002.
[ bib  .ps  .pdf ] 

[27] 
A. Fishkin, K. Jansen, and M. Mastrolilli. On minimizing average weighted
completion time: A PTAS for the job shop problem with release dates. In T.
Ibaraki, N. Katoh, and H. Ono, editors, In Proceedings of the 14th Annual
International Symposium on Algorithms and Computation (ISAAC 2003), volume
2906 of Lecture Notes in Computer Science, pages 319328. Springer
Verlag, Berlin, Germany, 2003.
[ bib ] 

[28] 
A.V. Fishkin, K. Jansen, and M. Mastrolilli. Grouping techniques for scheduling
problems: simpler and faster. In F.M. auf der Heide, editor, Proceedings
of ESA 2001  9th Annual European Symposium on Algorithms, volume 2161
of Lecture Notes in Computer Science, pages 206217. Springer Verlag,
Berlin, Germany, 2001.
[ bib ] 

[29]

L. M. Gambardella, A. E. Rizzoli, F. Oliverio, N. Casagrande, A. V. Donati,
R. Montemanni, and E. Lucibello.
Ant colony optimization for vehicle routing in advanced logistics
systems.
In A. G. Bruzzone and R. Mosca, editors, MAS2003  The
International Workshop on Modeling & Applied Simulation, pages 39, 2003.
[ bib ]


[30] 
H. H. Hoos, K. Smyth, and T. Stützle. Search space features underlying
the performance of stochastic local search algorithms for MAXSAT. In Proceedings
of PPSNVIII, Eigth International Conference on Parallel Problem Solving
from Nature, volume 3242 of Lecture Notes in Computer Science,
pages 5160. Springer Verlag, Berlin, Germany, 2004.
[ bib ] 

[31] 
K. Jansen, M. Mastrolilli, and R. SolisOba. Job shop problems with controllable
processing times. In A. Restivo et al., editor, Proceedings of ICTCS 2001
 7th Italian Conference on Theoretical Computer Science, volume 2202
of Lecture Notes in Computer Science, pages 107122. Springer Verlag,
Berlin, Germany, 2001.
[ bib ] 

[32] 
P. Kostuch and K. Socha. Hardness prediction for the university course
timetabling problem. In J. Gottlieb and G. R. Raidl, editors, Evolutionary
Computation in Combinatorial Optimization, 4th European Conference, EvoCOP
2004, volume 3004 of Lecture Notes in Computer Science, pages
135144. Springer Verlag, Berlin, Germany, 2004.
[ bib  .pdf ] 

[33] 
L. Lessing, I. Dumitrescu, and T. Stützle. A comparison between ACO
algorithms for the set covering problem. In M. Dorigo, M. Birattari, C. Blum,
L. M. Gambardella, F. Mondada, and T. Stützle, editors, Proceedings
of ANTS 2004  Fourth International Workshop on Ant Colony Optimization and
Swarm Intelligence, volume 3172 of Lecture Notes in Computer Science,
pages 112. Springer Verlag, Berlin, Germany, 2004.
[ bib ] 

[34] 
M. LópezIbáñez, L. Paquete, and T. Stützle.
On the design of ACO for the biobjective quadratic assignment problem. In
M. Dorigo, M. Birattari, C. Blum, L. M. Gambardella, F. Mondada, and T. Stützle,
editors, Proceedings of ANTS 2004  Fourth International Workshop on Ant
Colony Optimization and Swarm Intelligence, volume 3172 of Lecture
Notes in Computer Science, pages 215226. Springer Verlag, Berlin, Germany,
2004.
[ bib ] 

[35] 
H.R. Lourenço, O. Martin, and T. Stützle. A beginner's introduction
to iterated local search. In Proceedings of the Fourth Metaheuristics
International Conference, volume 1, pages 16, 2001.
[ bib  .ps  .pdf ] 

[36] 
M. Mastrolilli. Combining arithmetic and geometric rounding techniques
for knapsack problems. In Proceedings of WEA 2001  1st International
Workshop on Experimental and Efficient Algorithms, volume 2138 of Lecture
Notes in Computer Science, pages 525534. Springer Verlag, Berlin, Germany,
2001.
[ bib ] 

[37] 
M. Mastrolilli. Grouping techniques for one machine scheduling subject
to precedence constraints. In R. Hariharan et al., editor, Proceedings
of FST & TCS 2001  21st Foundations of Software Technology and Theoretical
Computer Science, volume 2245 of Lecture Notes in Computer Science,
pages 268279. Springer Verlag, Berlin, Germany, 2001.
[ bib ] 

[38] 
M. Mastrolilli. A PTAS for the Single Machine Scheduling Problem with Controlable
Processing Times. In M. Penttonen and E.M. Schmidt, editors, Proceedings
of SWAT 2002  Eigth Scandinavian Workshop on Algorithm Theory, volume
2368 of Lecture Notes in Computer Science, pages 5159. Springer
Verlag, Berlin, Germany, 2002.
[ bib ] 

[39] 
M. Mastrolilli. Scheduling to minimize max flow time: Offline and online
algorithms. In Proceedings of FCT 2003  14th International Symposium
on Foundamentals of Computation Theory, volume 2751 of Lecture Notes
in Computer Science, pages 4960. Springer Verlag, Berlin, Germany, 2003.
[ bib ] 

[40] 
M. Mastrolilli and L. Bianchi. Core instances for testing: a case study.
In Proceedings of WEA 2003  2nd International Workshop on Experimental
and Efficient Algorithms, volume 2647 of Lecture Notes in Computer
Science, pages 209221. Springer Verlag, Berlin, Germany, 2003.
[ bib ] 

[41] 
M. Mastrolilli and L. M. Gambardella. MAX2SAT: How good is tabu search
in the worstcase? In Proceedings of the 19th National Conference on Artificial
Intelligence (AAAI04). AAAI Press, 2004.
[ bib ] 

[42] 
L. Paquete, M. Chiarandini, and T. Stützle. Pareto local optimum sets
in the biobjective traveling salesman problem: An experimental study. In
X. Gandibleux, M. Sevaux, K. Sörensen, and V. T'kindt, editors, Multiobjective
Metaheuristics, Lecture Notes in Economics and Mathematical Systems.
Springer Verlag, 2003. To appear.
[ bib  .pdf ] 

[43] 
L. Paquete and T. Stützle. Empirical analysis of tabu search for the
lexicographic optimization of the examination timetabling problem. In E.
Burke and P. De Causmaecker, editors, Proceedings of PATAT 2002  Fourth
International the Conference on Practice and Theory of Automated Timetabling,
pages 413420. KaHo SintLieven, Department of Industrial Engineering, Gent,
Belgium, 2002. Also available as technical report AIDA0202, Intellektik,
TU Darmstadt.
[ bib  .pdf ] 

[44] 
L. Paquete and T. Stützle. Experimental investigation of iterated
local search for coloring graphs. In S. Cagnoni et al., editor, Applications
of Evolutionary Computing, Proceedings of EvoWorkshops 2002, volume 2279
of Lecture Notes in Computer Science, pages 122131. Springer Verlag,
Berlin, Germany, 2002.
[ bib  .pdf ] 

[45] 
L. Paquete and T. Stützle. A study of local optima in the biobjective
travelling salesman problem. In Proceedings of the Multiobjective Metaheuristics
Workshop (MOMH), 2002.
[ bib  .pdf ] 

[46] 
L. Paquete and T. Stützle. A twophase local search for the biobjective
traveling salesman problem. In C. Fonseca, P. Fleming, E. Zitzler, K. Deb,
and L. Thiele, editors, Proceedings of the Evolutionary Multicriterion
Optimization (EMO 2003), volume 2632 of Lecture Notes in Computer
Science, pages 479493. Springer Verlag, Berlin, Germany, 2003. Also
available as Technical Report AIDA0206, FG Intellektik, FB Informatik,
TU Darmstadt, 2002.
[ bib  .pdf ] 

[47] 
C. Piscopo and M. Birattari. Invention vs. discovery. a critical discussion.
In S. Lange et al., editor, Proceedings of DS 2002  5th International
Conference on Discovery Science, volume 2534 of Lecture Notes in Computer
Science, pages 457462. Springer Verlag, Berlin, Germany, 2002. Also
available as: TRIRIDIA200213.2 Technical Report of IRIDIA, Université Libre
de Bruxelles, Brussels, Belgium.
[ bib  .ps.gz  .pdf ] 

[48] 
A. Roli and C. Blum. Critical parallelization of local search for MAXSAT.
In F. Esposito, editor, AI*IA2001: Advances in Artificial Intelligence,
volume 1792 of Lecture Notes in Artificial Intelligence, pages 147158.
Springer Verlag, Berlin, Germany, 2001.
[ bib ] 

[49] 
A. Roli, C. Blum, and M. Dorigo. ACO for maximal constraint satisfaction
problems. In Proceedings of the Fourth Metaheuristics International Conference,
volume 1, pages 187191. Porto, Portugal, 2001.
[ bib ] 

[50]

O. RossiDoria, C. Blum, J. Knowles, M. Sampels, K. Socha, and B. Paechter.
A local search for the timetabling problem.
In E. Burke and P. De Causmaecker, editors, Proceedings of PATAT
2002  Fourth International the Conference on Practice and Theory of
Automated Timetabling, pages 124127. KaHo SintLieven, Department of
Industrial Engineering, Gent, Belgium, 2002.
[ bib 
.pdf ]


[51] 
O. RossiDoria and B. Paechter. A memetic algorithm for university course
timetabling. In Proceedings of Combinatorial Optimisation, CO 2004,
2004.
[ bib ] 

[52]

O. RossiDoria, M. Sampels, M. Birattari, M. Chiarandini, M. Dorigo, L. M.
Gambardella, J. Knowles, M. Manfrin, M. Mastrolilli, B. Paechter, L. Paquete,
and T. Stützle.
A comparison of the performance of different metaheuristics on the
timetabling problem.
In E. Burke and P. De Causmaecker, editors, Proceedings of PATAT
2002  Fourth International the Conference on Practice and Theory of
Automated Timetabling, pages 115119. KaHo SintLieven, Department of
Industrial Engineering, Gent, Belgium, 2002.
[ bib 
.pdf ]


[53]

O. RossiDoria, M. Sampels, M. Birattari, M. Chiarandini, M. Dorigo, L. M.
Gambardella, J. Knowles, M. Manfrin, M. Mastrolilli, B. Paechter, L. Paquete,
and T. Stützle.
A comparison of the performance of different metaheuristics on the
timetabling problem.
In Practice and Theory of Automated Timetabling IV: 4th
International Conference, PATAT 2002, Gent, Belgium, August 2123, 2002.
Selected Revised Papers, volume 2740 of Lecture Notes in Computer
Science, pages 329354. Springer Verlag, Berlin, Germany, 2003.
[ bib 
.pdf ]


[54] 
M. Sampels. Visualization of Automorphisms and VertexSymmetry. In R. Wyrzykowski
et al., editor, Proceedings of PPAM 2002  4th International Conference
on Parallel Processing & Applied Mathematics, volume 2328 of Lecture
Notes in Computer Science, pages 3541. Springer Verlag, Berlin, Germany,
2002.
[ bib ] 

[55]

M. Sampels, C. Blum, M. Mastrolilli, and O. RossiDoria.
Metaheuristics for Group Shop Scheduling.
In J.J. Merelo Guervós et al., editor, Proceedings of
PPSNVII, Seventh International Conference on Parallel Problem Solving from
Nature, number 2439 in Lecture Notes in Computer Science, pages 631640.
Springer Verlag, Berlin, Germany, 2002.
[ bib 
.pdf ]


[56]

T. Schiavinotto and T. Stützle.
Search space analysis of the linear ordering problem.
In G. Raidl et al., editor, Applications of Evolutionary
Computing, Proceedings of EvoWorkshops 2003, number 2611 in Lecture Notes in
Computer Science, pages 322333. Springer Verlag, Berlin, Germany, 2003.
[ bib 
.pdf ]


[57]

K. Smith, H. Hoos, and T. Stützle.
Iterated robust tabu search for MAXSAT.
In Y. Xiang and B. Chaibdraa, editors, Advances in Artificial
Intelligence, 16th Conference of the Canadian Society for Computational
Studies of Intelligence, volume 2671 of Lecture Notes in Computer
Science, pages 129144. Springer Verlag, Berlin, Germany, 2003.
[ bib 
.pdf ]


[58]

K. Socha.
The Influence of RunTime Limits on Choosing Ant
System Parameters.
In E. CantuPaz et al., editor, Proceedings of GECCO
2003  Genetic and Evolutionary Computation Conference, volume 2723 of
Lecture Notes in Computer Science, pages 4960. Springer Verlag, Berlin,
Germany, 2003.
[ bib 
.pdf ]


[59]

K. Socha, J. Knowles, and M. Sampels.
A MAX MIN Ant System for the University
Timetabling Problem.
In M. Dorigo, G. Di Caro, and M. Sampels, editors, Proceedings
of ANTS 2002  From Ant Colonies to Artificial Ants: Third International
Workshop on Ant Algorithms, volume 2463 of Lecture Notes in Computer
Science, pages 113. Springer Verlag, Berlin, Germany, 2002.
[ bib 
.ps.gz 
.pdf ]


[60]

K. Socha, M. Sampels, and M. Manfrin.
Ant Algorithms for the University Course Timetabling
Problem with Regard to the StateoftheArt.
In Proceedings of EvoCOP 2003  3rd European Workshop on
Evolutionary Computation in Combinatorial Optimization, volume 2611 of
Lecture Notes in Computer Science, pages 334345. Springer Verlag, Berlin,
Germany, 2003.
[ bib 
.pdf ]


[61]

T. Stützle and S. Fernandes.
New benchmark instances for the qap and the experimental analysis of
algorithms.
In J. Gottlieb and G. R. Raidl, editors, Evolutionary
Computation in Combinatorial Optimization, 4th European Conference, EvoCOP
2004, volume 3004 of Lecture Notes in Computer Science, pages
199209. Springer Verlag, Berlin, Germany, 2004.
[ bib 
.pdf ]


[62]

T. Stützle and S. Linke.
Experiments with Variants of Ant Algorithms.
In Proceedings of AEB 2002  First Spanish Congress on
Evolutionary and Bioinspired Algorithms, pages 253259, 2002.
[ bib ]


[63]

M. Zlochin and M. Dorigo.
Modelbased search for combinatorial optimization: A comparative
study.
In J.J. Merelo Guervós et al., editor, Proceedings of
PPSNVII, Seventh International Conference on Parallel Problem Solving from
Nature, volume 2439 of Lecture Notes in Computer Science, pages
651661. Springer Verlag, Berlin, Germany, 2002.
[ bib ]

