Eduardo Canale
YOU?
Author Swipe
View article: Qubo model for the Closest Vector Problem
Qubo model for the Closest Vector Problem Open
In this paper we consider the closest vector problem (CVP) for lattices $Λ\subseteq \mathbb{Z}^n$ given by a generator matrix $A\in \mathcal{M}_{n\times n}(\mathbb{Z})$. Let $b>0$ be the maximum of the absolute values of the entries of the…
View article: Counterexample to a Boesch's Conjecture
Counterexample to a Boesch's Conjecture Open
A key issue in network reliability analysis. A graph with $n$ nodes and whose $e$ edges fail independently with probability $p$ is an \emph{Uniformly Most Reliable Graph} (UMRG) if it has the highest reliability among all graphs with the s…
View article: The Palindromic Trees
The Palindromic Trees Open
The family of trees with palindromic characteristic polynomials is characterized. Large families of graphs with this property are found as well.
View article: From weighted to unweighted graphs in Synchronizing Graph Theory
From weighted to unweighted graphs in Synchronizing Graph Theory Open
A way to associate unweighted graphs from weighted ones is presented, such that linear stable equilibria of the Kuramoto homogeneous model associated to both graphs coincide, i.e., equilibria of the system $\dotθ_i = \sum_{j \sim i} \sin(θ…
View article: Production Optimization in a Grain Facility through Mixed-Integer Linear Programming
Production Optimization in a Grain Facility through Mixed-Integer Linear Programming Open
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…
View article: Solving the Max-Diversity Orthogonal Regrouping Problem by an Integer Linear Programming Model and a GRASP/VND with Path-Relinking Approach
Solving the Max-Diversity Orthogonal Regrouping Problem by an Integer Linear Programming Model and a GRASP/VND with Path-Relinking Approach Open
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. M…
View article: Tromino Tilings with Pegs via Flow Networks
Tromino Tilings with Pegs via Flow Networks Open
A tromino tiling problem is a packing puzzle where we are given a region of connected lattice squares and we want to decide whether there exists a tiling of the region using trominoes with the shape of an L. In this work we study a slight …
View article: The complete bipartite graph $K_{4,4}$ is Uniformly Most-Reliable
The complete bipartite graph $K_{4,4}$ is Uniformly Most-Reliable Open
In network design, the all-terminal reliability maximization is of paramount importance. In this classical setting, we assume a simple graph with perfect nodes but independent edge failures with identical probability $\rho$. The goal is to…
View article: Finding uniformly most reliable graphs by counting trivial cuts
Finding uniformly most reliable graphs by counting trivial cuts Open
There is a vast literature focused on network reliability evaluation. In the last decades, reliability optimization has been also addressed. Frank Boesch in 1986 introduced the concept of uniformly most reliable graph (UMRG). Later, Boesch…
View article: Factorization and exact evaluation of the source‐terminal diameter‐constrained reliability
Factorization and exact evaluation of the source‐terminal diameter‐constrained reliability Open
In classical network reliability, the system under study is a network with perfect nodes and imperfect links that fail randomly and independently. The probability that a given subset of terminal nodes belongs to the same connected componen…
View article: Optimal Edge Fault-Tolerant Embedding of a Star over a Cycle
Optimal Edge Fault-Tolerant Embedding of a Star over a Cycle Open
Vol. 45 – 2017 – 7th Latin-American Workshop on Cliques in Graphs.
View article: Diagnóstico mediante qPCR de las razas 1, 2 y 4 tropical de Fusarium oxysporum f. sp. cubensis, agente causal del mal de Panamá de las musáceas
Diagnóstico mediante qPCR de las razas 1, 2 y 4 tropical de Fusarium oxysporum f. sp. cubensis, agente causal del mal de Panamá de las musáceas Open
Fusarium oxysporum f. sp. cubensis (Foc), agente causal del mal de Panama, es uno de los patogenos mas nocivos que afectan las musaceas y no puede ser diferenciado morfologicamente de otros F. oxysporum. La enfermedad tiene un largo period…
View article: Robustness of Cucker–Smale flocking model
Robustness of Cucker–Smale flocking model Open
Consider a system of autonomous interacting agents moving in space, adjusting each own velocity as a weighted mean of the relative velocities of the other agents. In order to test the robustness of the model, the authors assume that each p…