A framework to collect and extract publication lists of a given researcher from the web. - Cristiano Mesquita Garcia; Armando Honorio Pereira; Denilson Alves Pereira (Int. J. Web Eng. Technol., 2017)

Formulations and algorithms for the Pickup and Delivery Traveling Salesman Problem with Multiple Stacks. - Armando Honorio Pereira; Sebastián Urrutia (Comput. Oper. Res., 2018)

The Two-Dimensional Guillotine Cutting Stock Problem with Stack Constraints. - Eduardo T. Bogue; Marcos V. A. Guimarães; Thiago F. Noronha; Armando Honorio Pereira; Iago A. Carvalho; Sebastián Urrutia (CLEI, 2021)

Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. - Armando Honorio Pereira; Geraldo Robson Mateus; Sebastián Alberto Urrutia (Eur. J. Oper. Res., 2022)

Branch-and-cut algorithms for the -arborescence star problem. - Armando Honorio Pereira; Geraldo Robson Mateus; Sebastián Urrutia (Int. Trans. Oper. Res., 2022)

The widest k-set of disjoint paths problem. - Marco A. Ribeiro; Iago Augusto de Carvalho; Armando Honorio Pereira (RAIRO Oper. Res., 2023)