6 citations · 9 across the 6 of their papers we have counts for
6 papers
An Faster Network Motif Detection Tool
Luis A. A. Meira, Vinícius R. Máximo, Alvaro L. Fazenda +1
Network motif provides a way to uncover the basic building blocks of most complex networks. This task usually demands high computer processing, specially for motif with 5 or more v…
Multi-Objective Vehicle Routing Problem Applied to Large Scale Post Office Deliveries
Luis A. A. Meira, Paulo S. Martins, Mauro Menzori +1
The number of optimization techniques in the combinatorial domain is large and diversified. Nevertheless, real-world based benchmarks for testing algorithms are few. This work crea…
VRPBench: A Vehicle Routing Benchmark Tool
Guilherme A. Zeni, Mauro Menzori, P. S. Martins +1
The number of optimization techniques in the combinatorial domain is large and diversified. Nevertheless, there is still a lack of real benchmarks to validate optimization algorith…
Fusion Tree Sorting
Luis A. A. Meira, Rogério H. B. de Lima
The sorting problem is one of the most relevant problems in computer science. Within the scope of modern computer science it has been studied for more than 70 years. In spite of th…
acc-Motif Detection Tool
Luis A. A. Meira, Vinicius R. Máximo, Álvaro L. Fazenda +1
Network motif algorithms have been a topic of research mainly after the 2002-seminal paper from Milo \emph{et al}, that provided motifs as a way to uncover the basic building block…
A Systematic Approach to Bound Factor-Revealing LPs and its Application to the Metric and Squared Metric Facility Location Problems
Cristina G. Fernandes, Luís A. A. Meira, Flávio K. Miyazawa +1
A systematic technique to bound factor-revealing linear programs is presented. We show how to derive a family of upper bound factor-revealing programs (UPFRP), and show that each s…