Zobrazeno 1 - 10
of 25
pro vyhledávání: '"G. S. Pinheiro"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Luiz Satoru Ochi, Teobaldo Bulhões, Lucídio dos Anjos Formiga Cabral, Fábio Protti, Rian G. S. Pinheiro, Gilberto Farias de Sousa Filho
Publikováno v:
Discrete Applied Mathematics. 301:118-130
Given a bipartite graph G = ( V 1 , V 2 , E ) , a biclique of G is a complete bipartite subgraph of G , and a biclique partitioning of G is a set A ⊆ E such that the bipartite graph G ′ = ( V 1 , V 2 , A ) is a vertex-disjoint union of bicliques.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7feb6afdc2775dd6160ee42779ada8ac
https://doi.org/10.1016/j.dam.2021.05.023
https://doi.org/10.1016/j.dam.2021.05.023
Publikováno v:
Anais do III Workshop Brasileiro de Cidades Inteligentes (WBCI 2022).
Para uma cidade ser classificada como "inteligente", ela precisa ter sensores espalhados por ela. A disseminação de dados em uma rede de sensores é um dos desafios que deve ser superado. Em particular, um problema de broadcasting é o WEIGHED MINI
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d92a6593618802e8683ca41c92b57573
https://doi.org/10.5753/wbci.2022.223039
https://doi.org/10.5753/wbci.2022.223039
Publikováno v:
International Transactions in Operational Research.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf31e9e2beef05000f242ce0384364be
https://doi.org/10.1111/itor.13146
https://doi.org/10.1111/itor.13146
Publikováno v:
Journal of Heuristics. 27:353-438
This paper presents an iterated local search (ILS) algorithm for the single machine total weighted tardiness batch scheduling problem. To our knowledge, this is one of the first attempts to apply ILS to solve a batching scheduling problem. The propos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0471fae463db15848d0e460748c1118f
https://doi.org/10.1007/s10732-020-09461-x
https://doi.org/10.1007/s10732-020-09461-x
Publikováno v:
Optimization Letters. 15:1345-1369
The generalized independent set problem (GISP) can be conceived as a relaxation of the maximum weight independent set problem. GISP has a number of practical applications, such as forest harvesting and handling geographic uncertainty in spatial infor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25f67e559f33d21050b074501fa12bc4
https://doi.org/10.1007/s11590-020-01643-7
https://doi.org/10.1007/s11590-020-01643-7
Autor:
Rian G. S. Pinheiro, Bruno Nogueira
Publikováno v:
Annals of Operations Research. 284:367-400
Given a graph G(V, E) and a value $$s \in {\mathbb {N}}$$, an s-plex S is a subset of V such that each vertex $$v \in S$$ has at least $$|S|-s$$ adjacent vertices in the subgraph induced by S. This work proposes a GPU based local search heuristic, ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13c3b6cce9baef10ea7b405ed26f8fa4
https://doi.org/10.1007/s10479-019-03159-5
https://doi.org/10.1007/s10479-019-03159-5
Autor:
Rian G. S. Pinheiro, Luiz Satoru Ochi, André Renato Villela da Silva, Bruno José da Silva Barros
Publikováno v:
Annals of Operations Research. 286:33-54
This paper deals with the Flooding Problem on graphs. This problem consists in finding the shortest sequence of flooding moves that turns a colored graph into a monochromatic one. The problem has applications in some areas as disease propagation, for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::177629c3ff37d6c4bb28c3bc8f460f85
https://doi.org/10.1007/s10479-018-2796-0
https://doi.org/10.1007/s10479-018-2796-0
Autor:
Rian G. S. Pinheiro, Bruno Nogueira
Publikováno v:
Computers & Operations Research. 90:232-248
Given an undirected graph with positive weights on the vertices, the Maximum Weight Clique Problem (MWCP) consists in finding a clique with maximum total weight. In this paper, we present a CPU-GPU local search heuristic for solving the MWCP on massi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f620032396d42d471b0f0e8417b1e36
https://doi.org/10.1016/j.cor.2017.09.023
https://doi.org/10.1016/j.cor.2017.09.023
Publikováno v:
Optimization Letters. 12:567-583
This paper presents a hybrid iterated local search (ILS) algorithm for the maximum weight independent set (MWIS) problem, a generalization of the classical maximum independent set problem. Two efficient neighborhood structures are proposed and they a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28887903db31976ce807cd88ba30d7b3
https://doi.org/10.1007/s11590-017-1128-7
https://doi.org/10.1007/s11590-017-1128-7