Dilson Lucas Pereira

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