default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDilson Lucas Pereira
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha:
Compact and non-compact formulations for the Dominated Coloring Problem. INOC 2024: 46-51- [c4]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: 30-42 - 2022
- [j12]Dilson Lucas Pereira
, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
Exact Solution Algorithms for the Chordless Cycle Problem. INFORMS J. Comput. 34(4): 1970-1986 (2022) - [j11]Vitor Notini Pontes, Dilson Lucas Pereira:
Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks. Int. Trans. Oper. Res. 29(3): 1520-1546 (2022) - [i2]Dilson Lucas Pereira, Michel Wan Der Maas Soares:
A 3-Approximation Algorithm for a Particular Case of the Hamiltonian p-Median Problem. CoRR abs/2204.12609 (2022) - 2020
- [j10]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: 104930 (2020) - [j9]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): 46-58 (2020) - [j8]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): 413-426 (2020) - [i1]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 abs/2008.02849 (2020)
2010 – 2019
- 2018
- [j7]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: 38-55 (2018) - [j6]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): 31-50 (2018) - 2015
- [j5]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: 149-160 (2015) - [j4]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): 367-379 (2015) - 2014
- [b1]Dilson Lucas Pereira:
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). Federal University of Minas Gerais, Brazil, 2014 - [j3]Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Gilbert Laporte, Dilson Lucas Pereira, Adam Wojciechowski:
A comparison of several models for the hamiltonian p-median problem. Networks 63(4): 350-363 (2014) - 2013
- [j2]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: 229-236 (2013) - 2011
- [j1]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: 315-320 (2011) - [c3]Stefan Gollowitzer, Dilson Lucas Pereira, Adam Wojciechowski:
New Models for and Numerical Tests of the Hamiltonian p-Median Problem. INOC 2011: 385-394
2000 – 2009
- 2008
- [c2]Ahmed Ali Abdalla Esmin, Dilson Lucas Pereira, Aluízio F. R. Araújo:
Study of different approach to clustering data by using the Particle Swarm Optimization Algorithm. IEEE Congress on Evolutionary Computation 2008: 1817-1822 - [c1]Ahmed Ali Abdalla Esmin, Dilson Lucas Pereira:
New Approaches to Clustering Data - Using the Particle Swarm Optimization Algorithm. ICEIS (2) 2008: 593-597
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-05 20:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
