Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Meira, Luis A. A."'
Autor:
Azorli, Samuel L., Meira, Luis A. A.
Vehicle Routing Problems are problems in which a set of customers is visited by a set of vehicles. In this work, we model a multiobjective benchmark on a 2D map based on a realistic routing problem of food deliveries by motorcycles in the city of Rio
Externí odkaz:
http://arxiv.org/abs/2102.02635
Autor:
Müller, Felipe F., Meira, Luis A. A.
Routing problems are often faced by companies who serve costumers through vehicles. Such problems have a challenging structure to optimize, despite the recent advances in combinatorial optimization. The goal of this project is to study and propose op
Externí odkaz:
http://arxiv.org/abs/1808.10866
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 vertices. This paper presents an extended methodology with the followin
Externí odkaz:
http://arxiv.org/abs/1804.09741
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 creates an extensible real-world mail delivery benchmark to the Vehicle Ro
Externí odkaz:
http://arxiv.org/abs/1801.00712
Autor:
Mahjour, Seyed Kourosh, Mendes da Silva, Luís Otávio, Meira, Luis Augusto Angelotti, Coelho, Guilherme Palermo, de Souza dos Santos, Antonio Alberto, Schiozer, Denis José
Publikováno v:
In Journal of Petroleum Science and Engineering February 2022 209
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 algorithms. In this work we introduce VRPBench, a tool to create instances and
Externí odkaz:
http://arxiv.org/abs/1610.05402
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 these facts, new sorting algorithms have been developed in recent years.
Externí odkaz:
http://arxiv.org/abs/1411.0048
Sorting is one of the most important problem in the computer science. After more than 60 years of studies, there are still many research devoted to develop faster sorting algorithms. This work aims to explain the Fusion Tree data structure. Fusion Tr
Externí odkaz:
http://arxiv.org/abs/1407.6753
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 blocks of most networks. In Bioinformatics, motifs have been mainly applied
Externí odkaz:
http://arxiv.org/abs/1203.3415
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 such program can be solved by a computer to bound the approximation fac
Externí odkaz:
http://arxiv.org/abs/1111.1672