A multi-operator genetic algorithm for the generalized minimum spanning tree problem. - Carlos Contreras Bolton; Gustavo Gatica; Carlos Rey Barra 001; Víctor Parada (Expert Syst. Appl., 2016)

Automatically Produced Algorithms for the Generalized Minimum Spanning Tree Problem. - Carlos Contreras Bolton; Carlos Rey 001; Sergio Ramos-Cossio; Claudio Rodríguez; Felipe Gatica; Víctor Parada (Sci. Program., 2016)

Novel Methods Generated by Genetic Programming for the Guillotine-Cutting Problem. - Vittorio Bertolini; Carlos Rey 001; Mauricio Sepúlveda; Víctor Parada (Sci. Program., 2018)

An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs. - Carlos Rey 001; Paolo Toth; Daniele Vigo (SCCC, 2020)

Automatic design of specialized algorithms for the binary knapsack problem. - Nicolás Acevedo; Carlos Rey 001; Carlos Contreras Bolton; Víctor Parada (Expert Syst. Appl., 2020)

Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem. - Laura Galli; Silvano Martello; Carlos Rey 001; Paolo Toth (Eur. J. Oper. Res., 2021)

The Organization of Fruit Collection Transport in Conditions of Extreme Rurality: A Rural CVRP Case. - Helmer Paz-Orozco; Osman Meléndez-Bermúdez; Jesús González-Feliu; Daniel Morillo 001; Carlos Rey 001; Gustavo Gatica (WEA, 2022)

Formulations and Metaheuristics for combinatorial optimization problems. - Carlos Rodrigo Rey Barra 001 (2022)

Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem. - Laura Galli; Silvano Martello; Carlos Rey 001; Paolo Toth (Discret. Appl. Math., 2023)

Automatic generation of a hybrid algorithm for the maximum independent set problem using genetic programming. - Moisés Silva-Muñoz; Carlos Contreras Bolton; Carlos Rey 001; Víctor Parada (Appl. Soft Comput., 2023)

Effective metaheuristics for the latency location routing problem. - Alan Osorio-Mora; Carlos Rey 001; Paolo Toth; Daniele Vigo (Int. Trans. Oper. Res., 2023)

Machine Learning-Driven Optimization for Solution Space Reduction in the Quadratic Multiple Knapsack Problem. - Diego Yáñez-Oyarce; Carlos Contreras Bolton; Fredy Troncoso-Espinosa; Carlos Rey 001 (IEEE Access, 2025)

The quadratic knapsack problem with setup. - Laura Galli; Silvano Martello; Carlos Rodrigo Rey Barra 001; Paolo Toth (Comput. Oper. Res., 2025)

Automatic clustering by automatically generated algorithms. - Moisés Silva-Muñoz; Jonnatan Oyarzún; Gustavo Silva Semaan; Carlos Contreras Bolton; Carlos Rey 001; Víctor Parada (Eng. Appl. Artif. Intell., 2025)