Author of the publication

Solving Approximation Problems by Ant Colony Programming

, and . Late Breaking Papers at the Genetic and Evolutionary Computation Conference (GECCO-2002), page 39--46. New York, NY, AAAI, (July 2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An Optimal Algorithm for Generating Minimal Perfect Hash Functions., , and . Inf. Process. Lett., 43 (5): 257-264 (1992)Solving Approximation Problems By Ant Colony Programming., and . GECCO, page 133. Morgan Kaufmann, (2002)Three Parallel Algorithms for Simulated Annealing.. PPAM, volume 2328 of Lecture Notes in Computer Science, page 210-217. Springer, (2001)Theoretical and Practical Issues of Parallel Simulated Annealing., and . PPAM, volume 4967 of Lecture Notes in Computer Science, page 189-198. Springer, (2007)Parallel Algorithms for Finding a Suboptimal Fundamental-Cycle Set in a Graph., , and . Parallel Comput., 19 (9): 961-971 (1993)A Parallel Memetic Algorithm for the Vehicle Routing Problem with Time Windows., and . 3PGCIC, page 144-151. IEEE, (2013)Ant Colony Programming for Approximation Problems., , and . GECCO, volume 2723 of Lecture Notes in Computer Science, page 142-143. Springer, (2003)Parallel Induction of Nondeterministic Finite Automata., , and . PPAM (1), volume 9573 of Lecture Notes in Computer Science, page 248-257. Springer, (2015)Generating Minimal Nondeterministic Finite Automata Using a Parallel Algorithm., , and . ISPDC, page 37-43. IEEE, (2020)New Selection Schemes in a Memetic Algorithm for the Vehicle Routing Problem with Time Windows., and . ICANNGA, volume 7824 of Lecture Notes in Computer Science, page 396-405. Springer, (2013)