CoDE Publications CoDE Publications
IRIDIA Publications IRIDIA Publications
SMG Publications
WIT Publications
WIT Publications
SMG Publications
Home People Research Activities Publications Teaching Resources
By Class By Topic By Year Technical Reports
By Class By Topic By Year Technical Reports
login
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, Ant Algorithms - Proceedings of ANTS 2002 - Third International Workshop, volume 2463 of Lecture Notes in Computer Science, pages 176-187, Berlin, Germany, 2002. Springer.
© Springer 2002

@inproceedings{BiaGamDor2002:ants,
  author = {Leonora Bianchi and Luca M. Gambardella and Marco Dorigo},
  editor = {Marco Dorigo and Gianni Di Caro and Michael Sampels},
  title = {Solving the Homogeneous Probabilistic Traveling Salesman
           Problem by the {ACO} Metaheuristic},
  year = {2002},
  booktitle = {Ant Algorithms -- Proceedings of ANTS 2002 -- Third International
               Workshop},
  volume = {2463},
  series = {Lecture Notes in Computer Science},
  pages = {176--187},
  address = {Berlin, Germany},
  publisher = {Springer}
}

Updated: 2017-03-27