Marco Riquelme-Leiva

According to our database, Marco Riquelme-Leiva authored at least 4 papers in 2015.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2015

A Binary Fruit Fly Optimization Algorithm to Solve the Set Covering Problem.

Broderick Crawford, Ricardo Soto, Claudio Torres-Rojas, Cristian Peña, Marco Riquelme-Leiva, Sanjay Misra, Franklin Johnson, Fernando Paredes

Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

A Comparison of Three Recent Nature-Inspired Metaheuristics for the Set Covering Problem.

Broderick Crawford, Ricardo Soto, Cristian Peña, Marco Riquelme-Leiva, Claudio Torres-Rojas, Sanjay Misra, Franklin Johnson, Fernando Paredes

Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

Modified Binary FireFly Algorithms with Different Transfer Functions for Solving Set Covering Problems.

Broderick Crawford, Ricardo Soto, Marco Riquelme-Leiva, Cristian Peña, Claudio Torres-Rojas, Franklin Johnson, Fernando Paredes

Proceedings of the Software Engineering in Intelligent Systems, 2015

Binarization Methods for Shuffled Frog Leaping Algorithms That Solve Set Covering Problems.

Broderick Crawford, Ricardo Soto, Cristian Peña, Marco Riquelme-Leiva, Claudio Torres-Rojas, Franklin Johnson, Fernando Paredes

Proceedings of the Software Engineering in Intelligent Systems, 2015