Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Carlos A. J. Martinhon"'
Autor:
Yannis Manoussakis, R. Saad, Carlos A. J. Martinhon, W. Fernandez de la Vega, H.P. Pham, Valentin Borozan, Rahul Muthu
Publikováno v:
European Journal of Combinatorics. 80:296-310
We consider maximum properly edge-colored trees in edge-colored graphs. We also consider the problem where, given a vertex r , determine whether the graph has a spanning tree rooted at r , such that all root-to-leaf paths are properly colored. We con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9569531028f711b16a282624dbe2aac
https://doi.org/10.1016/j.ejc.2018.02.027
https://doi.org/10.1016/j.ejc.2018.02.027
Autor:
Pedro Henrique González, Philippe Michelon, Edcarllos Santos, Luidi Simonetti, Carlos A. J. Martinhon
Publikováno v:
Computers & Operations Research. 76:134-146
This paper presents an iterated local search for the fixed-charge uncapacitated network design problem with user-optimal flow (FCNDP-UOF), which concerns routing multiple commodities from its origin to its destination by signing a network through sel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c4efd1ba49d879fcd062d1f8fdfadbe
https://doi.org/10.1016/j.cor.2016.06.016
https://doi.org/10.1016/j.cor.2016.06.016
Autor:
Alessandro Jackson Teixeira de Lima, Wallace Giovanni Rodrigues do Valle, Carlos A. J. Martinhon, Mariana Rodrigues de Almeida, João Carlos Correia Baptista Soares de Mello, Bruno Guimarães Torres
Publikováno v:
Operations Management for Social Good ISBN: 9783030238155
This article aims to evaluate the hybrid efficiency of solar and electrical energy for all Brazilian states. This assessment required a financial and economic analysis. From this model, we used the network data envelopment analysis to identify the mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9e521712216a88667fd730b9892fe31
https://doi.org/10.1007/978-3-030-23816-2_6
https://doi.org/10.1007/978-3-030-23816-2_6
Publikováno v:
Repositório Institucional da UFRN
Universidade Federal do Rio Grande do Norte (UFRN)
instacron:UFRN
Universidade Federal do Rio Grande do Norte (UFRN)
instacron:UFRN
In this paper, we propose a new way to define the size of organizations or Decision Making Units (DMUs) based on Data Envelopment Analysis (DEA). A great number of managerial decisions, social and economic activities, political analysis and engineeri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7e4281864f07460bcf075ed085fc0f53
https://doi.org/10.1016/j.omega.2018.10.014
https://doi.org/10.1016/j.omega.2018.10.014
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2015, 602, ⟨10.1016/j.tcs.2015.08.016⟩
Theoretical Computer Science, Elsevier, 2015, 602, ⟨10.1016/j.tcs.2015.08.016⟩
International audience; We introduce a number of problems regarding edge-color modifications in edge-colored graphs and digraphs. Consider a property π, a c -edge-colored graph GcGc not satisfying π, and an edge-recoloring cost matrix R=[rij]c×cR=
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1492e75349922b69caa2864ddc0d2836
https://doi.org/10.1016/j.tcs.2015.08.016
https://doi.org/10.1016/j.tcs.2015.08.016
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2013, 161 (6), ⟨10.1016/j.dam.2012.10.025⟩
Discrete Applied Mathematics, Elsevier, 2013, 161 (6), ⟨10.1016/j.dam.2012.10.025⟩
International audience; We deal with different algorithmic questions regarding properly arc-colored s–ts–t trails, paths and circuits in arc-colored digraphs. Given an arc-colored digraph DcDc with c≥2c≥2 colors, we show that the problem of d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::329a9cef176f592719d0693f9dbc639b
Autor:
Fábio Protti, Carlos A. J. Martinhon
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 45:181-196
A vertex i of a graph G=(V,E) is said to be controlled by M ⊆ V if the majority of the elements of the neighborhood of i (including itself) belong to M. The set M is a monopoly in G if every vertex i ∈ V is controlled by M. Given a set M ⊆ V an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c207dbfddbee3c70c4ae1966f67c36d
https://doi.org/10.1051/ita/2011006
https://doi.org/10.1051/ita/2011006
Publikováno v:
Computers & Operations Research. 37:1805-1813
In this work we deal with sandwich graphs G=(V,E) and present the notion of vertices f-controlled by a subset [email protected]?V. We introduce the generalized max-controlled set problem (GMCSP), where minimum gaps (defined by function f) and positiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5cc74258c2e67fac98c4b6c7892a3b78
https://doi.org/10.1016/j.cor.2010.01.012
https://doi.org/10.1016/j.cor.2010.01.012
Publikováno v:
Discrete Applied Mathematics. 158:1404-1417
This paper deals with problems on non-oriented edge-colored graphs. The aim is to find a route between two given vertices s and t. This route can be a walk, a trail or a path. Each time a vertex is crossed by a walk there is an associated non-negativ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::45d3761940d155403ffb2dce47726b03
https://doi.org/10.1016/j.dam.2010.03.009
https://doi.org/10.1016/j.dam.2010.03.009
Publikováno v:
Journal of Parallel and Distributed Computing. 69:239-246
This paper presents two new randomized distributed algorithms for the generation of acyclic orientations upon anonymous distributed systems of arbitrary topology. Both algorithms, called Alg-Neighbors and Alg-Edges, make use of biased and unbiased di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec272b344a08485c98341df1897eb324
https://doi.org/10.1016/j.jpdc.2008.11.009
https://doi.org/10.1016/j.jpdc.2008.11.009