Dilson Lucas Pereira - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 17 from 17

2024

Compact and non-compact formulations for the Dominated Coloring ProblemDilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha. inoc 2024: 46-51 [doi]

2022

Exact Solution Algorithms for the Chordless Cycle ProblemDilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti. informs, 34(4):1970-1986, 2022. [doi]

Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasksVitor Notini Pontes, Dilson Lucas Pereira. itor, 29(3):1520-1546, 2022. [doi]

2020

Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problemDilson Almeida Guimarães, Alexandre Salles da Cunha, Dilson Lucas Pereira. eor, 280(1):46-58, 2020. [doi]

Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problemDilson Lucas Pereira, Alexandre Salles da Cunha. eor, 284(2):413-426, 2020. [doi]

A multiperiod workforce scheduling and routing problem with dependent tasksDilson Lucas Pereira, Júlio César Alves, Mayron César O. Moreira. cor, 118:104930, 2020. [doi]

2018

Reformulations and branch-and-price algorithm for the Minimum Cost Hop-and-root Constrained Forest ProblemDilson Lucas Pereira, Alexandre Salles da Cunha. cor, 98:38-55, 2018. [doi]

Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problemDilson Lucas Pereira, Alexandre Salles da Cunha. networks, 71(1):31-50, 2018. [doi]

2015

Lower bounds and exact algorithms for the quadratic minimum spanning tree problemDilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha. cor, 63:149-160, 2015. [doi]

Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problemDilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha. networks, 65(4):367-379, 2015. [doi]

2014

p-median problemStefan Gollowitzer, Luis Gouveia, Gilbert Laporte, Dilson Lucas Pereira, Adam Wojciechowski. networks, 63(4):350-363, 2014. [doi]

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. PhD thesis, Federal University of Minas Gerais, Brazil, 2014. [doi]

2013

Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency CostsDilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha. endm, 41:229-236, 2013. [doi]

2011

New Models for and Numerical Tests of the Hamiltonian p-Median ProblemStefan Gollowitzer, Dilson Lucas Pereira, Adam Wojciechowski. inoc 2011: 385-394 [doi]

Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest ProblemDilson Lucas Pereira, Alexandre Salles da Cunha, Geraldo Robson Mateus. endm, 37:315-320, 2011. [doi]

2008

New Approaches to Clustering Data - Using the Particle Swarm Optimization AlgorithmAhmed Ali Abdalla Esmin, Dilson Lucas Pereira. ICEIS 2007: 593-597

Study of different approach to clustering data by using the Particle Swarm Optimization AlgorithmAhmed Ali Abdalla Esmin, Dilson Lucas Pereira, Aluizio F. R. Araújo. cec 2008: 1817-1822 [doi]

Sign in or sign up to see more results.

runs on WebDSL