Lucídio A. F. Cabral

Orcid: 0000-0002-6117-5571

Affiliations:
  • Federal University of Paraíba, Computer Science Center


According to our database1, Lucídio A. F. Cabral authored at least 26 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An efficient implementation of a VNS heuristic for the weighted fair sequences problem.
Int. Trans. Oper. Res., May, 2024

2021
The biclique partitioning polytope.
Discret. Appl. Math., 2021

2019
A hybrid metaheuristic for the minimum labeling spanning tree problem.
Eur. J. Oper. Res., 2019

A polyhedral approach to the generalized minimum labeling spanning tree problem.
EURO J. Comput. Optim., 2019

Solving the minimum labeling global cut problem by mathematical programming.
CoRR, 2019

2018
Efficient heuristics for the minimum labeling global cut problem.
Electron. Notes Discret. Math., 2018

The Weighted Fair Sequences Problem.
Comput. Oper. Res., 2018

Continuous greedy randomized adaptive search procedure for data clustering.
Appl. Soft Comput., 2018

A Semi-Supervised Approach for the Semantic Segmentation of Trajectories.
Proceedings of the 19th IEEE International Conference on Mobile Data Management, 2018

2017
Branch-and-cut approaches for p-Cluster Editing.
Discret. Appl. Math., 2017

Branch-and-price for <i>p</i>-cluster editing.
Comput. Optim. Appl., 2017

New heuristics for the Bicluster Editing Problem.
Ann. Oper. Res., 2017

2016
A parallel hybrid metaheuristic for bicluster editing.
Int. Trans. Oper. Res., 2016

DC-GRASP: directing the search on continuous-GRASP.
J. Heuristics, 2016

2015
GRASP-UTS: an algorithm for unsupervised trajectory segmentation.
Int. J. Geogr. Inf. Sci., 2015

A matheuristic approach for the Pollution-Routing Problem.
Eur. J. Oper. Res., 2015

2014
The discrete ellipsoid covering problem: A discrete geometric programming approach.
Discret. Appl. Math., 2014

2012
Optimization and implementation of a system for allocating services integrated with the Google Maps service.
OR Insight, 2012

Hybrid Metaheuristic for Bicluster Editing Problem.
Electron. Notes Discret. Math., 2012

Uma Arquitetura e Ferramentas para Problemas de Localização de Facilidades no Setor Público.
Proceedings of the 8th Brazilian Symposium on Information Systems, 2012

2011
A Novel Method for Selecting and Materializing Views based on OLAP Signatures and GRASP.
J. Inf. Data Manag., 2011

2009
Fatores Organizacionais e sua Influência na Segurança da Informação em Universidades Públicas: Um Estudo Empírico.
Proceedings of the 5th Brazilian Symposium on Information Systems, 2009

2008
Metaheurísticas aplicadas à geraçao de carrossel no sistema brasileiro de TV Digital.
Proceedings of the 14th Brazilian Symposium on Multimedia and Web Systems, 2008

An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2008

2006
An Efficient Heuristic for the Ring Star Problem.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

2002
TDR: A Distributed-Memory Parallel Routing Algorithm for FPGAs.
Proceedings of the Field-Programmable Logic and Applications, 2002


  Loading...