Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Eduardo Canale"'
Publikováno v:
Applied Sciences, Vol 12, Iss 16, p 8212 (2022)
This article introduces a Mixed-Integer Linear Programming model for cost optimization in multi-product multi-line production scheduling. This model considers discrete time windows and includes realistic constraints. The NP completeness of the proble
Externí odkaz:
https://doaj.org/article/40aedc425de64623a23a006c9221d866
Publikováno v:
Symmetry, Vol 14, Iss 1, p 18 (2021)
Students from Master of Business Administration (MBA) programs are usually split into teams. In light of the generalistic nature of MBA programs, diversity within every team is desirable in terms of gender, major, age and other criteria. Many schools
Externí odkaz:
https://doaj.org/article/1b16b8631cd34966abf47b8227a9e796
Autor:
Eduardo Canale, Claudio Risso
Publikováno v:
Annals of Operations Research. 316:1187-1203
This document analyses the problem of designing a minimum cost local wind turbine grid (or LWTG) for an onshore wind farm. The LWTG is responsible for adding up the power of the farm’s wind turbines to then deliver it to a high voltage network. To
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c617089d81c94572b81cf932ccdacb4
https://doi.org/10.1007/s10479-021-04133-w
https://doi.org/10.1007/s10479-021-04133-w
Publikováno v:
International Transactions in Operational Research. 29:908-928
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e56eeff984bcacebd0f77dc3ecc38641
https://doi.org/10.1111/itor.12807
https://doi.org/10.1111/itor.12807
Publikováno v:
Smart Cities ISBN: 9783030967529
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6fc7d954ed230c49ef835060510383ec
https://doi.org/10.1007/978-3-030-96753-6_8
https://doi.org/10.1007/978-3-030-96753-6_8
Autor:
Pablo Monzon, Eduardo Canale
Publikováno v:
Systems Structure and Control
A few decades ago, Y. Kuramoto introduced a mathematical model of weakly coupled oscillators that gave a formal framework to some of the works of A.T. Winfree on biological clocks [Kuramoto (1975), Kuramoto (1984), Winfree (1980)]. The model proposes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2ba79b5248839beebd96af1a32b29bb
http://www.intechopen.com/articles/show/title/almost_global_synchronization_of_symmetric_kuramoto_coupled_oscillators
http://www.intechopen.com/articles/show/title/almost_global_synchronization_of_symmetric_kuramoto_coupled_oscillators
Publikováno v:
DRCN
The physical support of the Internet infrastructure is fiber-optics network (FON). Since the global Internet traffic doubles each year, FONs are suffering the capacity crunch problem, and several proposals offer content-oriented solutions, combined w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6fef5ebc2db806679b47150366cc66b8
https://doi.org/10.1109/drcn48652.2020.1570611164
https://doi.org/10.1109/drcn48652.2020.1570611164
Publikováno v:
DRCN
A fundamental problem in network reliability analysis is to find the connectedness probability of a random graph subject to perfect nodes and independent link failures with identical probabilities. This connectedness probability is called the all-ter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b29b0eda636b40b0d6b52c73ac111a4d
https://doi.org/10.1109/drcn.2019.8713759
https://doi.org/10.1109/drcn.2019.8713759
Publikováno v:
DRCN
There is a strong interplay between network reliability and connectivity theory. In fact, previous studies show that the graphs with maximum reliability, called uniformly most-reliable graphs, must have the highest connectivity. In this paper, we rev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::405e9e1deeec0efec96a1ded34c52a07
https://doi.org/10.1109/drcn.2019.8713756
https://doi.org/10.1109/drcn.2019.8713756
Publikováno v:
Variable Neighborhood Search ISBN: 9783030158422
ICVNS
ICVNS
In this paper we address a metaheuristic for an combinatorial optimization problem. For any given graph \(\mathcal {G}=(V,E)\) (where the nodes represent items and edges correlations), we want to find the clique \(\mathcal {C} \subseteq V\) such that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2732b39939c72608a0d5d1c041ee012b
https://doi.org/10.1007/978-3-030-15843-9_3
https://doi.org/10.1007/978-3-030-15843-9_3