Dilson Lucas Pereira

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 11

Top Venues

Federal University of Minas Gerais, Brazil (PHD)

Education History

Federal University of Minas Gerais, Brazil

PHD

Publications

Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha
Compact and non-compact formulations for the Dominated Coloring Problem. INOC (2024)
Dilson Lucas Pereira, Dilson Almeida Guimarães, Alexandre Salles da Cunha, Abilio Lucena
Quadratically Constrained Reformulation, Strong Semidefinite Programming Bounds, and Algorithms for the Chordless Cycle Problem. ISCO (2024)
Vitor Notini Pontes, Dilson Lucas Pereira
Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks. Int. Trans. Oper. Res. 29 (3) (2022)
Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti
Exact Solution Algorithms for the Chordless Cycle Problem. INFORMS J. Comput. 34 (4) (2022)
Dilson Lucas Pereira, Michel Wan Der Maas Soares
A 3-Approximation Algorithm for a Particular Case of the Hamiltonian p-Median Problem. CoRR (2022)
Dilson Lucas Pereira, Júlio César Alves, Mayron César O. Moreira
A multiperiod workforce scheduling and routing problem with dependent tasks. Comput. Oper. Res. 118 (2020)
Dilson Almeida Guimarães, Alexandre Salles da Cunha, Dilson Lucas Pereira
Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem. Eur. J. Oper. Res. 280 (1) (2020)
Dilson Lucas Pereira, Alexandre Salles da Cunha
Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem. Eur. J. Oper. Res. 284 (2) (2020)
Dilson Lucas Pereira, Júlio César Alves, Mayron César de Oliveira Moreira
A Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks. CoRR (2020)
Dilson Lucas Pereira, Alexandre Salles da Cunha
Reformulations and branch-and-price algorithm for the Minimum Cost Hop-and-root Constrained Forest Problem. Comput. Oper. Res. 98 (2018)
Dilson Lucas Pereira, Alexandre Salles da Cunha
Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem. Networks 71 (1) (2018)
Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha
Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem. Networks 65 (4) (2015)
Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha
Lower bounds and exact algorithms for the quadratic minimum spanning tree problem. Comput. Oper. Res. 63 (2015)
Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Gilbert Laporte, Dilson Lucas Pereira, Adam Wojciechowski
-median problem. Networks 63 (4) (2014)
Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha
Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency Costs. Electron. Notes Discret. Math. 41 (2013)
Stefan Gollowitzer, Dilson Lucas Pereira, Adam Wojciechowski
New Models for and Numerical Tests of the Hamiltonian p-Median Problem. INOC (2011)
Dilson Lucas Pereira, Alexandre Salles da Cunha, Geraldo Robson Mateus
Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem. Electron. Notes Discret. Math. 37 (2011)
Ahmed Ali Abdalla Esmin, Dilson Lucas Pereira
New Approaches to Clustering Data - Using the Particle Swarm Optimization Algorithm. ICEIS (2) (2008)
Ahmed Ali Abdalla Esmin, Dilson Lucas Pereira, Aluizio F. R. Araújo
Study of different approach to clustering data by using the Particle Swarm Optimization Algorithm. IEEE Congress on Evolutionary Computation (2008)

Dilson Lucas Pereira.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Dilson Lucas Pereira