Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Breno Piva"'
Autor:
Breno Piva, Cid C. de Souza
Publikováno v:
Computers & Operations Research. 80:184-197
We study integer programming ( ip ) models for the problem of finding a rectangular partition of a rectilinear polygon with minimum stabbing number. Strong valid inequalities are introduced for an existing formulation and a new model is proposed. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f912b7a633925a84c5945d6841e1d743
https://doi.org/10.1016/j.cor.2016.12.014
https://doi.org/10.1016/j.cor.2016.12.014
Autor:
André Britto, Beatriz Trinchão Andrade, Sandra Avila, Nívea Neyara Bomfim Melo, Breno Piva, Davi Silva dos Santos
Publikováno v:
Revista dos Trabalhos de Iniciação Científica da UNICAMP.
About 815 million people in the world suffer from chronic undernourishment. Paradoxically, 1.3 billion tonnes of food is wasted each year. When food surpluses occur, the best destination — which ensures the highest value use of edible food resource
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e238041ca260c9192c604969f479bf9
https://doi.org/10.20396/revpibic2620181099
https://doi.org/10.20396/revpibic2620181099
Autor:
Breno Piva, Cid C. de Souza
Publikováno v:
Electronic Notes in Discrete Mathematics. 50:267-273
We study integer programming models for the problem of finding a rectangular partition of a rectilinear polygon with minimum stabbing number. Polyhedral investigations and computational tests are reported for the first time for the problem.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::209f240e97b0e5f0393f4853b396ec3c
https://doi.org/10.1016/j.endm.2015.07.045
https://doi.org/10.1016/j.endm.2015.07.045
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319961507
ISCO
ISCO
The Next Release Problem (nrp) is an important problem in Software Engineering. Several papers investigate the nrp, most of them considering heuristics to solve the problem. However, the literature lacks a more theoretical approach to this problem, s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::080364ec6635e1391df1069814c63bc1
https://doi.org/10.1007/978-3-319-96151-4_3
https://doi.org/10.1007/978-3-319-96151-4_3
Publikováno v:
RAIRO - Operations Research. 48:211-233
The problem of finding structures with minimum stabbing number has received considerable attention from researchers. Particularly, [10] study the minimum stabbing number of perfect matchings (mspm), spanning trees (msst) and triangulations (mstr) ass
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::074f7c7972b28324e506614123349a58
https://doi.org/10.1051/ro/2014008
https://doi.org/10.1051/ro/2014008
Publikováno v:
Discrete Applied Mathematics. 160(18):2523-2541
In the Maximum Common Edge Subgraph Problem (MCES), given two graphs G and H with the same number of vertices, one has to find a common subgraph of G and H (not necessarily induced) with the maximum number of edges. This problem arises in parallel pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7922aa8b8390f2ed8b34580dbf53fe29
Autor:
Breno Piva, Cid C. de Souza
Publikováno v:
Annals of Operations Research. 199:77-102
In this paper we present an exact algorithm for the Maximum Common Induced Subgraph Problem (MCIS) by addressing it directly, using Integer Programming (IP) and polyhedral combinatorics. We study the MCIS polytope and introduce strong valid inequalit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::525c11b81c57245f40ba23b7e9833168
https://doi.org/10.1007/s10479-011-1019-8
https://doi.org/10.1007/s10479-011-1019-8
Autor:
Breno Piva
Publikováno v:
Biblioteca Digital de Teses e Dissertações da Universidade Estadual de Campinas (UNICAMP)
Universidade Estadual de Campinas (UNICAMP)
instacron:UNICAMP
Universidade Estadual de Campinas (UNICAMP)
instacron:UNICAMP
Orientador: Cid Carvalho de Souza Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação Resumo: Problemas de trespasse têm sido investigados há tempos em Geometria Computacional pois aplicações para eles são encontradas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cbf4485d7271a36a993d230bd4757dca
Autor:
Breno Piva, Cid C. de Souza
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642321467
ISCO
ISCO
The minimum stabbing triangulation of a set of points in the plane (mstr) was previously investigated in the literature. The complexity of the mstr remains open and, to our knowledge, no exact algorithm was proposed and no computational results were
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c384a306c8d2d9705e99816049cee40
https://doi.org/10.1007/978-3-642-32147-4_5
https://doi.org/10.1007/978-3-642-32147-4_5
Autor:
Andreia Araújo Morandim-Giannetti, Kevy Pontes Eliodorio, Vitor Seorra Andolfatto, Marco Rulevas Martins, Breno Pivaro de Sá, Erick Umeki
Publikováno v:
The Journal of Engineering and Exact Sciences, Vol 3, Iss 2, Pp 267-280 (2017)
Initially, we performed the synthesis and characterization of sec-butylammonium acetate IL and chitosan activation with it. Afterwards, we used the activated chitosan to carry out the adsorption of chromium VI, which is the main metallic ion present
Externí odkaz:
https://doaj.org/article/2cce19c040784abcad15be19ec36c670