Zobrazeno 1 - 10
of 240
pro vyhledávání: '"Geraldo Robson Mateus"'
Publikováno v:
Journal of Applied Mathematics, Vol 2017 (2017)
Externí odkaz:
https://doaj.org/article/8c3f5453d07d41f9bff4996c5fce2844
Publikováno v:
Journal of Applied Mathematics, Vol 2017 (2017)
This paper addresses the unrelated parallel machines scheduling problem with sequence and machine dependent setup times. Its goal is to minimize the makespan. The problem is solved by a combinatorial Benders decomposition. This method can be slow to
Externí odkaz:
https://doaj.org/article/cab5a479c17542fa8c4684c3d2fdcbb9
Publikováno v:
European Journal of Operational Research. 300:207-220
The focus of this work is the study of valid inequalities and exact algorithms for the pickup and delivery traveling salesman problem with multiple stacks. In the problem, a single vehicle must fulfill a set of client requests. Each request states th
Publikováno v:
International Transactions in Operational Research. 29:2374-2400
Publikováno v:
Computers & Operations Research. 102:91-101
We consider a problem arising in the design of ad-hoc wireless sensor networks. Given a connected bidirectional digraph with n sensors and a fixed sink, the p-arborescence star problem is the problem of clustering the sensors into p disjoint subsets
Publikováno v:
Artificial Intelligence and Soft Computing ISBN: 9783030878962
ICAISC (2)
ICAISC (2)
In the present work, we have applied and compared Deep Reinforcement Learning techniques to solve a problem usually addressed with Operations Research tools. State-of-the-art Policy Gradient methods are used in a production planning and product distr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::003fc38ae19ae25c10c890b70628a3c8
https://doi.org/10.1007/978-3-030-87897-9_21
https://doi.org/10.1007/978-3-030-87897-9_21
Autor:
Lucas Assunção, Geraldo Robson Mateus
The Steiner Team Orienteering Problem (STOP) is defined on a digraph in which arcs are associated with traverse times, and whose vertices are labeled as either mandatory or profitable, being the latter provided with rewards (profits). Given a homogen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::90a7c3d9809a06a8d20b9cd5d2ab8386
http://arxiv.org/abs/2101.01530
http://arxiv.org/abs/2101.01530
Autor:
Gustavo Campos Menezes, Joao F. M. Sarubbi, Geraldo Robson Mateus, Lucas Teodoro de Lima Santos
Publikováno v:
Heuristics for Optimization and Learning ISBN: 9783030589295
This chapter discusses various optimization problems existing in the process of storing and transporting loads. In particular, we investigated an optimization problem involving the production planning, product allocation, and scheduling of products i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0b0dc27b32943a4c31310b79f28afdd
https://doi.org/10.1007/978-3-030-58930-1_8
https://doi.org/10.1007/978-3-030-58930-1_8
Publikováno v:
SBRC
A alocação de recursos é um problema NP-difícil, presente no Mapeamento de Redes Virtuais (VNE) e na Virtualização de Funções de Rede (NFV). Nesse contexto, um ponto pouco explorado na literatura é relacionado a quando se deve aplicar um mé
Autor:
V.F. Navarro Torres, Geraldo Robson Mateus, Leonardo Soares Chaves, W. Carneiro, A.G. Martins
Publikováno v:
Journal of the Southern African Institute of Mining and Metallurgy, Volume: 120, Issue: 11, Pages: 617-626, Published: NOV 2020
SYNOPSIS Operational mine planning is a fundamental activity in mine operations and should take into account various characteristics of the material, the available mining faces, the requirements of discharge points, and production hiatuses due to red
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1880e09757efa3e0b2ebb339a4f924af
http://www.scielo.org.za/scielo.php?script=sci_arttext&pid=S2225-62532020001100005&lng=en&tlng=en
http://www.scielo.org.za/scielo.php?script=sci_arttext&pid=S2225-62532020001100005&lng=en&tlng=en