Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Bianca de Almeida Dantas"'
Autor:
Wilton Gustavo Gomes da Costa, Ricardo Santos, Willy Alves de Oliveira Soler, Bianca de Almeida Dantas
Publikováno v:
Revista Principia, Vol 62, Iss 0 (2025)
The Vehicle Routing Problem (VRP) is a classical optimization problem that aims to find routes for a fleet of vehicles to meet the demands of a set of customers. Due to its wide applicability, especially in the logistics sector, numerous VRP variants
Externí odkaz:
https://doaj.org/article/47d1df53330441808983751f3b650e16
Publikováno v:
Journal of Parallel and Distributed Computing. 120:211-221
The recent progresses in the development and improvement of multicore/manycore architectures instigate the design of algorithms capable of exploring the functionalities provided by these architectures to solve more efficiently hard problems. The NP -
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cec1b47901622b9fb78236715fdf1775
https://doi.org/10.1016/j.jpdc.2018.02.031
https://doi.org/10.1016/j.jpdc.2018.02.031
Publikováno v:
Anais Estendidos do Simpósio em Sistemas Computacionais de Alto Desempenho (WSCAD).
Um dos problemas mais conhecidos de otimização combinatória, que possui diversas aplicações práticas, é o problema da mochila multidimensional (MKP). Apesar de sua popularidade e da demanda por soluções de alta qualidade, este é u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a48439d9678a92056d81fa5402d20639
https://doi.org/10.5753/wscad_estendido.2019.8703
https://doi.org/10.5753/wscad_estendido.2019.8703
Publikováno v:
WSCAD
In the area of combinatorial optimization, the Quadratic Assignment Problem stands out due to its complexity and its range of applications. The main goal of this work, is to analyze the performance of Simulated Annealing when applied to the QAP. In a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f3ae84380ee78b3f06eca978ed60435
https://doi.org/10.1109/wscad.2018.00014
https://doi.org/10.1109/wscad.2018.00014
Publikováno v:
ICCS
The knapsack problem is a widely known problem in combinatorial optimization and has been object of many researches in the last decades. The problem has a great number of variants and obtaining an exact solution to any of these is not easily accompli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b73da47567300fce3850fd4c12f7de9
https://doi.org/10.1016/j.procs.2015.05.411
https://doi.org/10.1016/j.procs.2015.05.411
Publikováno v:
SBAC-PAD
In the last decades, with the advances in multicore/manycore architectures, it became interesting to design algorithms which can take advantage of such architectures aiming the achievement of more efficient algorithms to solve difficult problems. A l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df753334c0341ea88c719ed3949ab198
https://doi.org/10.1109/sbac-pad.2016.25
https://doi.org/10.1109/sbac-pad.2016.25
Publikováno v:
CLEI
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1d5beb963116b0ad89fd6bb4b65e313
https://doi.org/10.1109/clei.2014.6965168
https://doi.org/10.1109/clei.2014.6965168