Study of different approach to clustering data by using the Particle Swarm Optimization Algorithm. - Ahmed Ali Abdalla Esmin; Dilson Lucas Pereira; Aluízio F. R. Araújo (IEEE Congress on Evolutionary Computation, 2008)

New Approaches to Clustering Data - Using the Particle Swarm Optimization Algorithm. - Ahmed Ali Abdalla Esmin; Dilson Lucas Pereira (ICEIS (2), 2008)

New Models for and Numerical Tests of the Hamiltonian p-Median Problem. - Stefan Gollowitzer; Dilson Lucas Pereira; Adam Wojciechowski (INOC, 2011)

Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem. - Dilson Lucas Pereira; Alexandre Salles da Cunha; Geraldo Robson Mateus (Electron. Notes Discret. Math., 2011)

Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency Costs. - Dilson Lucas Pereira; Michel Gendreau; Alexandre Salles da Cunha (Electron. Notes Discret. Math., 2013)

A comparison of several models for the hamiltonian p-median problem. - Stefan Gollowitzer; Luis Eduardo Neves Gouveia; Gilbert Laporte; Dilson Lucas Pereira; Adam Wojciechowski (Networks, 2014)

Formulações e algoritmos baseados em programação linear inteira para o problema quadrático da árvore geradora mínima. (Formulations and algorithms based on linear integer programming for the quadratic minimum spanning tree problem). - Dilson Lucas Pereira (2014)

Lower bounds and exact algorithms for the quadratic minimum spanning tree problem. - Dilson Lucas Pereira; Michel Gendreau; Alexandre Salles da Cunha (Comput. Oper. Res., 2015)

Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem. - Dilson Lucas Pereira; Michel Gendreau; Alexandre Salles da Cunha (Networks, 2015)

Reformulations and branch-and-price algorithm for the Minimum Cost Hop-and-root Constrained Forest Problem. - Dilson Lucas Pereira; Alexandre Salles da Cunha (Comput. Oper. Res., 2018)

Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem. - Dilson Lucas Pereira; Alexandre Salles da Cunha (Networks, 2018)

A multiperiod workforce scheduling and routing problem with dependent tasks. - Dilson Lucas Pereira; Júlio César Alves; Mayron César O. Moreira (Comput. Oper. Res., 2020)

A Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks. - Dilson Lucas Pereira; Júlio César Alves; Mayron César de Oliveira Moreira (CoRR, 2020)

Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem. - Dilson Almeida Guimarães; Alexandre Salles da Cunha; Dilson Lucas Pereira (Eur. J. Oper. Res., 2020)

Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem. - Dilson Lucas Pereira; Alexandre Salles da Cunha (Eur. J. Oper. Res., 2020)

A 3-Approximation Algorithm for a Particular Case of the Hamiltonian p-Median Problem. - Dilson Lucas Pereira; Michel Wan Der Maas Soares (CoRR, 2022)

Exact Solution Algorithms for the Chordless Cycle Problem. - Dilson Lucas Pereira; Abilio Lucena; Alexandre Salles da Cunha; Luidi Simonetti (INFORMS J. Comput., 2022)

Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks. - Vitor Notini Pontes; Dilson Lucas Pereira (Int. Trans. Oper. Res., 2022)

Compact and non-compact formulations for the Dominated Coloring Problem. - Dilson Lucas Pereira; Abilio Lucena; Alexandre Salles da Cunha (INOC, 2024)

Quadratically Constrained Reformulation, Strong Semidefinite Programming Bounds, and Algorithms for the Chordless Cycle Problem. - Dilson Lucas Pereira; Dilson Almeida Guimarães; Alexandre Salles da Cunha; Abilio Lucena (ISCO, 2024)