default search action
Eduardo Alberto Canale
Person information
- affiliation: University of the Republic, Montevideo, Uruguay
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j15]Claudio E. Risso
, Eduardo Alberto Canale
Cost Optimized Design for the Local Wind Turbine Grid of an Onshore Wind Farm. Ann. Oper. Res. 316(2): 1187-1203 (2022) - [j14]Mathias Bourel, Eduardo Alberto Canale
Complexity and heuristics for the weighted max cut-clique problem. Int. Trans. Oper. Res. 29(2): 908-928 (2022) - [j13]Eduardo A. Canale
Solving the Max-Diversity Orthogonal Regrouping Problem by an Integer Linear Programming Model and a GRASP/VND with Path-Relinking Approach. Symmetry 14(1): 18 (2022) - 2021
- [c18]Gabriel Bayá
A Case Study of Smart Industry in Uruguay: Grain Production Facility Optimization. ICSC-Cities 2021: 101-115 - [c17]Javier T. Akagi, Eduardo A. Canale, Marcos Villagra:
Tromino Tilings with Pegs via Flow Networks. LAGOS 2021: 459-467 - 2020
- [c16]Eduardo Alberto Canale
Design of Most-Reliable Cubic Networks by Augmentations. DRCN 2020: 1-6 - [i4]Javier T. Akagi, Eduardo A. Canale, Marcos Villagra:
Tromino Tilings with Pegs via Flow Networks. CoRR abs/2007.12651 (2020)
2010 – 2019
- 2019
- [c15]Mathias Bourel, Eduardo A. Canale
Building Highly Reliable Networks with GRASP/VND Heuristics. DRCN 2019: 91-98 - [c14]Eduardo A. Canale
Building Reliability-Improving Network Transformations. DRCN 2019: 107-113 - [c13]Mathias Bourel
A Hybrid GRASP/VND Heuristic for the Design of Highly Reliable Networks. HM 2019: 78-92 - 2018
- [c12]Mathias Bourel, Eduardo Alberto Canale
Complexity and Heuristics for the Max Cut-Clique Problem. ICVNS 2018: 28-40 - [c11]Mathias Bourel, Eduardo A. Canale
A GRASP/VND Heuristic for the Max Cut-Clique Problem. LOD 2018: 357-367 - 2017
- [j12]Eduardo Alberto Canale
Factorization and exact evaluation of the source-terminal diameter-constrained reliability. Networks 70(4): 283-291 (2017) - 2016
- [c10]Eduardo A. Canale
Dominance of the 1-twisted equilibrium point for Kuramoto coupled oscillators with underlying Harary graphs. CCA 2016: 1221-1225 - [c9]Eduardo A. Canale
Factorization theory in diameter constrained reliability. RNDM 2016: 66-71 - [c8]Eduardo A. Canale
Network utility problem and easy reliability polynomials. RNDM 2016: 79-84 - 2015
- [j11]Eduardo A. Canale
Optimal Edge Fault-Tolerant Bijective Embedding of a Complete Graph over a Cycle. Electron. Notes Discret. Math. 50: 217-222 (2015) - [j10]Eduardo Alberto Canale
Full complexity analysis of the diameter-constrained reliability. Int. Trans. Oper. Res. 22(5): 811-821 (2015) - [j9]Eduardo Alberto Canale
Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior. Networks 66(4): 296-305 (2015) - [c7]Eduardo Alberto Canale
Recursive Variance Reduction method in stochastic monotone binary systems. RNDM@WMNC 2015: 135-141 - 2014
- [j8]Eduardo A. Canale, Héctor Cancela, Franco Robledo, Pablo Romero, Pablo Sartor:
Diameter-constrained K-reliability evaluation: complexity and heuristics. Int. J. Metaheuristics 3(3): 223-243 (2014) - [j7]Eduardo A. Canale
The complexity of computing the 2-K-reliability in networks. Inf. Process. Lett. 114(9): 457-461 (2014) - [j6]Eduardo Alberto Canale
Monte Carlo methods in diameter-constrained reliability. Opt. Switch. Netw. 14: 134-148 (2014) - [c6]Eduardo Alberto Canale
Diameter-Constrained Reliability: Complexity, Factorization and Exact computation in Weak Graphs. LANC 2014: 12:1-12:7 - [i3]Eduardo A. Canale, Pablo Romero:
Diameter Constrained Reliability: Computational Complexity in terms of the diameter and number of terminals. CoRR abs/1404.3684 (2014) - [i2]Eduardo Alberto Canale, Pablo Romero, Gerardo Rubino:
Irrelevant Components and Exact Computation of the Diameter Constrained Reliability. CoRR abs/1409.7688 (2014) - [i1]Eduardo A. Canale, Pablo Romero, Gerardo Rubino:
A Full Characterization of Irrelevant Components in Diameter Constrained Reliability. CoRR abs/1410.0707 (2014) - 2013
- [j5]Eduardo Alberto Canale
On computing the 2-diameter -constrained K -reliability of networks. Int. Trans. Oper. Res. 20(1): 49-58 (2013) - [c5]Claudio E. Risso, Eduardo Alberto Canale
Using metaheuristics for planning resilient and cost-effective multilayer networks. ICUMT 2013: 201-207 - 2010
- [c4]Eduardo Alberto Canale
On the Complexity of the Classification of Synchronizing Graphs. FGIT-GDC/CA 2010: 186-195
2000 – 2009
- 2009
- [c3]Eduardo Alberto Canale
Global properties of Kuramoto bidirectionally coupled oscillators in a ring structure. CCA/ISIC 2009: 183-188 - [c2]Eduardo Alberto Canale
Global Synchronization Properties for Different Classes of Underlying Interconnection Graphs for Kuramoto Coupled Oscillators. FGIT 2009: 104-111 - 2007
- [c1]Eduardo Alberto Canale
Gluing Kuramoto coupled oscillators networks. CDC 2007: 4596-4601 - 2005
- [j4]Eduardo A. Canale
Asymptotically large (Delta, D)-graphs. Discret. Appl. Math. 152(1-3): 89-108 (2005) - 2004
- [j3]Eduardo A. Canale
Superfluous edges and exponential expansions of De Bruijn and Kautz graphs. Discret. Appl. Math. 138(3): 303-331 (2004) - 2003
- [j2]José Gómez, Eduardo A. Canale
Unilaterally connected large digraphs and generalized cycles. Networks 42(4): 181-188 (2003) - 2000
- [j1]José Gómez, Eduardo A. Canale, Xavier Muñoz:
On the unilateral (Delta, D*)-problem. Networks 36(3): 164-171 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: