Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Fábio Luiz Usberti"'
Publikováno v:
EURO Journal on Computational Optimization, Vol 11, Iss , Pp 100080- (2023)
Consider an undirected graph with demands scattered over the edges and a homogeneous fleet of vehicles to service the demands. In the open capacitated arc routing problem (OCARP) the objective is to find a set of routes that collectively service all
Externí odkaz:
https://doaj.org/article/c038836ad8334cd49c4cfb711e13ba81
Publikováno v:
Trends in Computational and Applied Mathematics, Vol 19, Iss 3 (2018)
Este trabalho tem por objetivo investigar e propôr novas formulações para o problema de cobertura por hubs capacitado de alocação única com custo fixo. Este problema envolve a localização de nós hubs e a atribuição de nós de demandas aos
Externí odkaz:
https://doaj.org/article/94e2be57e6b940b687e41ba00ca5b4f3
Publikováno v:
RAIRO - Operations Research. 57:1149-1166
The Covering Salesman Problem (CSP) is a generalization of the Traveling Salesman Problem in which the tour is not required to visit all vertices, as long as all vertices are covered by the tour. The objective of CSP is to find a minimum length Hamil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::32b12d4508fdab49438da8893cc491d4
https://doi.org/10.1051/ro/2023055
https://doi.org/10.1051/ro/2023055
Autor:
Jônatas Trabuco Belotti, José Jair Alves Mendes Junior, Ivette Luna, Patrícia Teixeira Leite Asano, Yara de Souza Tadano, Thiago Antonini Alves, Marcella Scoczynski Ribeiro Martins, Fábio Luiz Usberti, Sergio Luiz Stevan Jr., Flávio Trojan, Hugo Valadares Siqueira
Publikováno v:
Learning and Nonlinear Models. 20:47-61
Linear models are widely used to perform time series forecasting. The Autoregressive models stand out, due to their simplicity in the parameters adjustment based on close-form solution. The Autoregressive and Moving Average models (ARMA) and Infinite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8449593697164333c1cacdc09bedbd9d
https://doi.org/10.21528/lnlm-vol20-no1-art4
https://doi.org/10.21528/lnlm-vol20-no1-art4
Publikováno v:
INFORMS Journal on Computing. 34:2003-2016
This paper presents the capacitated and economic districting problem (CEDP), which searches for the best edge partition defining connected, capacitated, and balanced districts in an undirected connected graph, weighing the economic value of each dist
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ed671602c8972a77b5c2873b29926d9
https://doi.org/10.1287/ijoc.2022.1180
https://doi.org/10.1287/ijoc.2022.1180
Publikováno v:
Procedia Computer Science. 195:478-488
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7971fc046ec5ba11ec64cdb9d8ccdd6f
https://doi.org/10.1016/j.procs.2021.11.058
https://doi.org/10.1016/j.procs.2021.11.058
Publikováno v:
Computers & Operations Research. 150:106050
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ca9f1dc4c952e835b2953da3fa1de14
https://doi.org/10.1016/j.cor.2022.106050
https://doi.org/10.1016/j.cor.2022.106050
Publikováno v:
Handbook of Smart Energy Systems ISBN: 9783030723224
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b45ee0f7787b99ded827b8b1ce5fc1e
https://doi.org/10.1007/978-3-030-72322-4_131-1
https://doi.org/10.1007/978-3-030-72322-4_131-1
Energy networks should strive for reliability. How can it be assessed, measured, and improved? What are the best trade-offs between investments and their worth? The flow-based framework for the reliability assessment of energy networks proposed in th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07ea2fb25307dab3c2c5e286c8009372
http://arxiv.org/abs/2108.00058
http://arxiv.org/abs/2108.00058
Publikováno v:
Computers & Operations Research. 103:288-295
The capacitated arc routing problem (CARP) is an important combinatorial optimization problem that has been extensively studied in the last decades. The objective is to optimize routes that service demands located on the edges of a graph, given a fle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::181403baadfe023c0a511208520e59d2
https://doi.org/10.1016/j.cor.2018.11.018
https://doi.org/10.1016/j.cor.2018.11.018