Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Pedro Henrique Del Bianco Hokama"'
Autor:
Guilherme G. Arcencio, Matheus T. Mattioli, Mário César San Felice, Pedro Henrique Del Bianco Hokama
Publikováno v:
Anais do VI Encontro de Teoria da Computação (ETC 2021).
In the k-Minimum Spanning Subgraph problem with d-Degree Center we want to find a minimum cost spanning connected subgraph with n - 1 + k edges and at least degree d in the center vertex, with n being the number of vertices. In this paper we describe
Publikováno v:
International Journal of Production Research. 58:2712-2729
This paper addresses a variant of two-dimensional cutting problems in which rectangular small pieces are obtained by cutting a rectangular object through guillotine cuts. The characteristics of thi...
Autor:
Mário César San Felice, Renan Barbosa de Morais, Gabriel Ávila Casalecchi, Pedro Henrique Del Bianco Hokama
Publikováno v:
Anais do XII Computer on the Beach - COTB '21.
Proportionality in political representation is an essential theme forrepresentative democracy. In Brazil, this debate appears in the contextof non-proportionality between a federative unit’s populationsize and its number of representatives in the C
Autor:
Felix Mora-Camino, R. Katarya, O. P. Verma, Pedro Henrique Del Bianco Hokama, Alexandre C. B. Ramos, Leandro Diniz de Jesus, Khmaies Ouahada, P. K. Grupta, A. J. Dantas, Ghanshyam Singh
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783030704155
The Corona Virus Disease 2019 (COVID-19) is an infectious disease caused by a newly discovered corona virus SARS-CoV-2. It is similar to the flu and raises concerns about the alarming levels of spread and severity, resulting in a continuous pandemic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ceb14810e67f92e76bfad4b82c84fbbd
https://doi.org/10.1007/978-3-030-70416-2_49
https://doi.org/10.1007/978-3-030-70416-2_49
Publikováno v:
Anais do Simpósio de Engenharia, Gestão e Inovação.
Autor:
Rafael C. S. Schouery, Thiago Alves de Queiroz, Flávio Keidi Miyazawa, Pedro Henrique Del Bianco Hokama
Publikováno v:
Computers & Industrial Engineering. 105:313-328
This work deals with the 0–1 knapsack problem in its two-dimensional version considering a conflict graph, where each edge in this graph represents a pair of items that must not be packed together. This problem arises as a subproblem of the bin pac
Publikováno v:
Information Processing Letters. 116:337-342
We study the Online Circle Packing Problem where we need to pack circles that arrive online in square bins with the objective to minimize the number of bins used. An online algorithm is said to have bounded space if at any given time, only a constant
Publikováno v:
Expert Systems with Applications. 47:1-13
A Branch-and-Cut Approach is proposed for the VRP with Loading Constraints.Several techniques are used such as metaheuristics, constraint programming and ILP.This problem arises in real-life problems in the area of transportation of goods.We improved