# Eduardo Álvarez-MirandaUniversidad de Talca · Departamento de Ingeniería Industrial

Eduardo Álvarez-Miranda

## About

83

Publications

11,600

Reads

**How we measure 'reads'**

A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more

613

Citations

Citations since 2017

## Publications

Publications (83)

Reducing emissions from power systems requires enhancing the penetration of non-conventional renewable energy sources (NCRE) in the generation mix. However, such penetration requires high levels of operational flexibility in order to ensure an adequate balance between generation and demand. Concentrating solar power plants with thermal storage (CSP...

Assembly lines are production flow systems wherein activities are organised around a line consisting of various workstations through which the product flows. At each station, the product is assembled through a subset of operations. The assembly line balancing problem (ALBP) consists of allocating operations between stations to maximise the system e...

Last-mile logistics corresponds to the last leg of the supply chain, i.e., the delivery of goods to final customers, and they comprise the core activities of postal and courier companies. Because of their role in the supply chain, last-mile operations are critical for the perception of customers regarding the performance of the whole logistic proce...

E-commerce sales have led to a considerable increase in the demand for last-mile delivery companies, revealing several problems in their logistics processes. Among these problems, are not meeting delivery deadlines. For example, in Chile, the national consumer service (SERNAC) indicated that in 2018, late deliveries represented 23% of complaints in...

Student dropout, defined as the abandonment of a high education program before obtaining the degree without reincorporation, is a problem that affects every higher education institution in the world. This study uses machine learning models over two Chilean universities to predict first-year engineering student dropout over enrolled students, and to...

The assembly line balancing problem is a classical optimisation problem whose objective is to assign each production task to one of the stations on the assembly line so that the total efficiency of the line is maximized. This study proposes a novel hybrid method to solve the simple version of the problem in which the number of stations is fixed, a...

El presente artículo considera la reactualización nostálgica del bolero en relación con la creación de una comunidad retro-utópica, la que da cuenta de la transformación capitalista del tiempo en mercancía. Lo anterior se realiza por medio de la consideración del grupo chileno La Flor del Recuerdo que retoma las canciones canónicas del género music...

Currently, in Chile, more than a quarter-million of patients are waiting for an elective surgical intervention. This is a worldwide reality, and it occurs as the demand for healthcare is vastly superior to the clinical resources in public systems. Moreover, this phenomenon has worsened due to the COVID-19 sanitary crisis. In order to reduce the imp...

In recent years, a wide range of techniques has been developed to predict electoral results and to measure the influence of different factors in these results. In this paper, we analyze the influence of the political profile of candidates (characterized by personal and political features) and their campaign effort (characterized by electoral expend...

Renewable energy technologies still endure critical technical and financial challenges. These challenges demand for specially tailored decision support tools for planning the (renewable-based) strategical expansion of power systems. However, existing tools not always adequately integrate the tactical and operational dimensions of power systems into...

Dominating set problems are among the most important class of combinatorial problems in graph optimization, from a theoretical as well as from a practical point of view. In this paper, we address the recently introduced (minimum) weighted total domination problem. In this problem, we are given an undirected graph with a vertex weight function and a...

Pharmacy inventory management is a critical process in healthcare centers. On the one hand, effective drug procurement is fundamental for fulfilling the therapeutic requirements of patients. On the other hand, as hospital pharmacies’ purchasing and storage costs comprise an important share in the hospital budgets, efficient inventory management may...

The simple assembly line balancing problem (SALBP) considers work division among different workstations of a serially arranged assembly process to maximise its efficiency under workload (cumulative) and technological (precedence) constraints. In this work, we consider a variant of the SALBP which allows parallel workstations. To study the effect of...

Electoral systems are modified by individuals who have incentives to bias the rules for their political advantage (i.e., gerrymandering). To prevent gerrymandering, legislative institutions can rely on mathematical tools to guarantee democratic fairness and territorial contiguity. These tools have been successfully used in the past; however, there...

In the last decades, a wide body of literature has been devoted to study different saliency detection methods. These methods are typically devised on the basis of different image analysis paradigms, which leads to different performances that are not always rankable, but rather complementary. In this paper, a network design-based framework for multi...

The data presented in this article are complementary material to our work entitled “A decision support system for prioritization of patients on surgical waiting lists: A biopsychosocial approach”. We prepared, together with physicians, a survey was used in the otorhinolaryngology unit of the Hospital of Talca for a period of five months, between Fe...

Planning for management actions that address threats to biodiversity is important for securing its long term persistence. However, systematic conservation planning (SCP) has traditionally overlooked this aspect and just focused on identifying priority areas without any recommendation on actions needed. This paper develops a mixed integer mathematic...

In many applications, such as telecommunications and routing, we seek for cost-effective infrastructure or operating layouts so that many nodes (e.g., customers) of a support network (typically modeled by a graph) are covered by, or at least are easily reachable from, such a layout. In this paper, we study the maximum covering cycle problem. In thi...

The global stock of buildings account for more than 40% of global energy consumption. Improving their energy behaviour thus offers tremendous potential for promoting sustainable development. While new buildings can be benefited from new construction methods and techniques for ensuring a sustainable operation, a sustainable operation of existing bui...

One of the most common systems in non-automated warehouses is drive-in pallet racking with a shared storage policy (which is usually based on the duration-of-stay). Such scheme targets towards an efficient use of storage space, since its operation costs are directly related to the size and layout of the warehouse. In this paper, two mathematical pr...

Dominating set problems are among the most important class of combinatorial problems in graph optimization, from a theoretical as well as from a practical point of view. In this paper, we address the recently introduced (minimum) weighted total domination problem. In this problem, we are given an undirected graph with a vertex weight function and a...

The design of conservation management plans is a crucial task for ensuring the preservation of ecosystems. A conservation plan is typically embodied by two types of decisions: in which areas of a given territory it will be implemented, and how actions against threats will be deployed across these areas. These decisions are usually guided by the res...

Facility and covering location models are key elements in many decision aid tools in logistics, supply chain design, telecommunications, public infrastructure planning, and many other industrial and public sectors. In many applications, it is likely that customers are not dichotomously covered by facilities, but gradually covered according to, e.g....

The design of nature reserves is becoming, more and more, a crucial task for ensuring the conservation of endangered wildlife. In order to guarantee the preservation of species and a general ecological functioning, the designed reserves must typically verify a series of spatial requirements. Among the required characteristics, practitioners and res...

The design of nature reserves is becoming, more and more, a crucial task for ensuring the conservation of endangered wildlife. In order to guarantee the preservation of species and a general ecological functioning, the designed reserves must typically verify a series of spatial requirements. Among the required characteristics, practitioners and res...

Facility and covering location models are key elements in many decision aid tools in logistics, supply chain design, telecommunications, public infrastructure planning, and many other industrial and public sectors. In many applications, it is likely that customers are not dichotomously covered by facilities, but gradually covered according to, e.g....

Assembly line balancing is a family of combinatorial optimization problems that has been widely studied in the literature due to its simplicity and industrial applicability. Most line balancing problems are NP-hard as they subsume the bin packing problem as a special case. Nevertheless, it is common in the line balancing literature to cite [A. Gutj...

Network science enables us to improve the performance of complex systems such as traffic, communication, and power grids. To do so, it is necessary to use a well-constructed flawless network dataset associated with the system of interest. In this study, we present the dataset of the Chilean power grid. We harmonized data from three diverse sources...

The tree \(t^*\)-spanner problem is an NP-hard problem, which is concerned with finding a spanning tree in a given undirected weighted graph, such that for each pair of nodes the ratio of the shortest distance in the spanning tree and the shortest distance in the given graph is bounded by t. The goal is to find a spanning tree, which gives the mini...

The minimum cost dominating tree problem is a recently introduced NP-hard problem, which consists of finding a tree of minimal cost in a given graph, such that for every node of the graph, the node or one of its neighbours is in the tree. We present an exact solution framework combining a primal–dual heuristic with a branch-and-cut approach based o...

The Steiner traveling salesman problem (StTSP) is a variant of the classical traveling salesman problem (TSP). In the StTSP, we are given a graph with edge distances, and a set of terminal nodes, which are a subset of all nodes. The goal is to find a minimum distance closed walk to visit each terminal node at least once. Two recent articles propose...

A core process in forestry planning corresponds to the design of optimal harvesting policies along with road network layouts. In the most common setting, decision makers seek for solutions that maximize the profit of the forest while respecting operative and market constraints. Due to the long-term nature of the industry, the inherent uncertainty i...

The Steiner traveling salesman problem (StTSP) is a variant of the classical traveling salesman problem (TSP). In the StTSP, we are given a graph with edge distances, and a set of terminal nodes, which are a subset of all nodes. The goal is to find a minimum distance closed walk, which visits each terminal node at least once. Two recent articles pr...

The tree t *-spanner problem is an NP-hard problem, which is concerned with finding a spanning tree in a given undirected weighted graph, such that for each pair of nodes the ratio of the shortest distance in the spanning tree and the shortest distance in the given graph is bounded by t. The goal is to find a spanning tree, which gives the minimal...

Experimental records show the existence of a biological linkage between neuronal death and Golgi apparatus fragmentation. The comprehension of such linkage should help to understand the dynamics undergoing neurological damage caused by diseases such as Alzheimer's disease or amyotrophic lateral sclerosis. In this paper, the bi-objective minimum car...

In this work, a mathematical programming model for aiding the decision-making process of olive harvest planning is proposed. The model aims at finding a harvest schedule of different land units that maximizes the total amount of the oil extracted in the mill. Such a harvest plan must ensure quality standards, respect technological limitations, coor...

This work studies an assembly line balancing problem with uncertainty on the task times. In order to deal with the uncertainty, a robust formulation to handle changes in the operation times is put forward. In order to solve the problem, several lower bounds, dominance rules and an enumeration procedure are proposed. These methods are tested in a co...

In many applications in telecommunications and routing, we seek for cost-effective infrastructure or operating layouts so that many nodes (e.g., customers) of a support network (typically modeled by a graph) are covered by, or at least are easily reachable from, such layout. In this paper, we study the maximum covering cycle problem. In this recent...

In this paper, a new routing problem, referred to as the Generalized Clustered Orienteering Problem (GCOP), is studied. The problem is motivated by the mobile phone game Pokémon GO, an augmented reality game for mobile devices holding a record-breaking reception: within the first month of its release, more than 100 million users have installed the...

Enhancing the role of renewable energies in existing power systems is one of the most crucial challenges that society faces today. However, the high variability of their generation potential and the temporal disparity between the demand and the generation potential represent technological and operational gaps that burden the massive incorporation o...

The present work proposes a novel Network Optimization problem whose core is to combine both network design and network construction scheduling under uncertainty into a single two-stage robust optimization model. The first-stage decisions correspond to those of a classical network design problem, while the second-stage decisions correspond to those...

We propose a multicriteria decision-making framework to support strategic decisions in forest management, taking into account uncertainty due to climate change and sustainability goals. In our setting, uncertainty is modeled by means of climate change scenarios. The decision task is to define a harvest scheduling that addresses, simultaneously, con...

Finding maximum weight connected subgraphs within networks is a fundamental combinatorial optimization problem both from theoretical and practical standpoints. One of the most prominent applications of this problem appears in Systems Biology and it corresponds to the detection of active subnetworks within gene interaction networks.
Due to its impor...

Problems aiming at finding budget constrained optimal upgrading schemes to improve network performance have received attention over the last two decades. In their general setting, these problems consist of designing a network and, simultaneously, allocating (limited) upgrading resources in order to enhance the performance of the designed network.
I...

An increased use of variable generation technologies such as wind power and photovoltaic generation can have important effects on system frequency performance during normal operation as well as contingencies. The main reasons are the operational principles and inherent characteristics of these power plants like operation at maximum power point and...

In this work, we consider the minimum-cost shared Steiner arborescence problem (SStA). In this problem, the goal is to find a minimum-cost subgraph, which is shared among multiple entities and each entity is able to establish a cost-efficient Steiner arborescence. The SStA has been recently used in the literature to establish shared functional modu...

In this paper a new routing problem referred to as the Generalized Clustered Orienteering Problem (GCOP) is studied. The problem is motivated by the mobile phone game Pokémon GO, an augmented reality game for mobile devices holding a record-breaking reception: within the first month of its release, more than 100 million users have installed the gam...

In this paper, a generalization of a recently proposed optimal path problem concerning decisions for improving connectivity is considered [see 6]. Each node in the given network is associated with a connection delay which can be reduced by implementing upgrading actions. For each upgrading action a cost must be paid, and the sum must satisfy a budg...

Finding maximum weight connected subgraphs within networks is a fundamental combinatorial optimization problem both from a theoretical and a practical standpoint. One of the most prominent applications of this problem appears in Systems Biology and it corresponds to the detection of active subnetworks within gene interaction networks. Due to its im...

Problems aiming at finding budget constrained optimal upgrading schemes to improve network performance have received attention over the last two decades. In their general setting, these problems consist of designing a network and, simultaneously, allocating (limited) upgrading resources in order to enhance the performance of the designed network. I...

In this paper, a generalization of a recently proposed optimal path problem concerning decisions for improving connectivity is considered (see Dilkina et al., 2011). Each node in the given network is associated with a connection delay which can be reduced by implementing upgrading actions. For each upgrading action a cost must be paid, and the sum...

The Golgi apparatus is well-known for its role as a sorting station in the secretory pathway as well as for its role in regulating post-translational protein modification. Another role for the Golgi is the regulation of cellular signaling by spatially regulating kinases, phosphatases, and GTPases. All these roles make it clear that the Golgi is a c...

This work deals with a facility location problem in which location and allocation (transportation) policy is defined in two stages such that a first-stage solution should be robust against the possible realizations (scenarios) of the input data that can only be revealed in a second stage. This solution should be robust enough so that it can be reco...

We consider a network design application that is modeled as the two-level network design problem under uncertainty. In this problem, one of the two available technologies can be installed on each edge and all customers of the network need to be served by at least the lower level (secondary) technology. The decision maker is confronted with uncertai...

We study a single-commodity Robust Network Design problem (RND) in which an undirected graph with edge costs is given together with a discrete set of balance matrices, representing different supply/demand scenarios. In each scenario, a subset of the nodes is exchanging flow. The goal is to determine the minimum cost installation of capacities on th...

In this paper we study a framework of CO problems for assessing the vulnerability of planar networks. The models have recently been proposed in the literature and their structure allows to obtain interesting vulnerability parameters. Now, we analyze the flexibility of model and the impact of certain parameters through an experimental analysis. This...

In this paper we present a collection of combinatorial optimization problems that allows to assess the vulnerability of spatial networks in the presence of disruptions. The proposed measures of vulnerability along with the model of failure are suitable in many applications where the consideration of failures in the transportation system is crucial....

The Minmax Regret Spanning Tree problem is studied in this paper. This is a generalization of the well-known Minimum Spanning Tree problem, which considers uncertainty in the cost function. Particularly, it is assumed that the cost parameter associated with each edge is an interval whose lower and upper limits are known, and the Minmax Regret is th...

In this paper we present a collection of combinatorial optimization problems that allows to assess the vulnerability of spatial networks in the presence of disruptions. The proposed measures of vulnerability
along with the model of failure are suitable in many applications where the consideration of failures in the transportation system is crucial....

Given a connected graph G=(V,E) with a nonnegative cost on each edge in E, a nonnegative prize at each vertex in V, and a target set V ' ⊆V, the Prize Collecting Steiner Tree (PCST) problem is to find a tree T in G interconnecting all vertices of V ' such that the total cost on edges in T minus the total prize at vertices in T is minimized. The PCS...

El presente estudio aborda el problema de Árbol de Expansión con incertidumbre intervalar en los costos, utilizando el criterio Min-Max Regret (MMR); se sabe que la complejidad computacional de este problema es alta. Se proponen e implementan algoritmos, tanto exactos como heurísticos. Descomposición de Benders (BD) y Branch and Cut (B&C), son impl...

We improve the well-known result presented in Bertsimas and Sim (Math Program B98:49–71, 2003) regarding the computation of optimal solutions of Robust Combinatorial Optimization problems with interval uncertainty in the objective function coefficients. We also extend this improvement to a more general class of Combinatorial Optimization problems w...

In the Prize-Collecting Steiner Tree Problem (PCStT) we are given a set of customers with potential revenues and a set of possible links connecting these customers with fixed installation costs. The goal is to decide which customers to connect into a tree structure so that the sum of the link costs plus the revenues of the customers that are left o...

Estimados usuarios, Debemos informar que debido a mantención programada, este sábado 30 de noviembre nuestra plataforma de servicios web NO estará disponible desde las 08:00 hasta las 18:00, lo que implica que no se podrán realizar trámites en línea. Solicitamos realizar las acciones respectivas y lamentamos las incomodidades que esta medida pueda...

Given a connected node-weighted (di)graph, with a root node r, and a (possibly empty) set of nodes R, the Rooted Maximum Node-Weight Connected Subgraph Problem (RMWCS) is the problem of finding a connected subgraph rooted at r that connects all nodes in R with maximum total weight. In this paper we consider the RMWCS as well as its budget-constrain...

We consider a robust network design problem in which op-timum integral capacities need to be installed on the edges of a network such that the supplies and demands in each of the explicitly known traf-fic scenarios are satisfied by a single-commodity flow. In Buchheim et al. (LNCS 6701, 7 -17 (2011)), an integer-programming (IP) formulation of poly...

Uncertainty in optimization is not a new ingredient. Diverse models considering uncertainty have been developed over the last 40 years. In our paper we essentially discuss a particular uncertainty model associated with combinatorial optimization problems, developed in the 90’s and broadly studied in the past years. This approach named minmax regret...

This paper considers the minimum connection problem in networks with uncertain data. In such a network it is assumed that one can establish a link e by paying a cost ce in a given interval [ce−,ce+] while taking a risk (ce+−ce)/(ce+−ce−) of link failure. We develop polynomial time algorithms for minimum cost network connection with paths or spannin...

We consider a combinatorial optimization problem that models an expansion of fiber optic telecommunication networks. Thereby, we are given a set of customers with potential gains of revenue and the set of edges with fixed installation costs. The goal is to decide which customers to connect to a given root node so that the sum of edge costs plus the...

Given a graph $G=(V,E)$ with a cost on each edge in $E$ and a prize at each vertex in $V$, and a target set $V'\subseteq V$, the Prize Collecting Steiner Tree (PCST) problem is to find a tree $T$ interconnecting vertices in $V'$ that has minimum total costs on edges and maximum total prizes at vertices in $T$. This problem is NP-hard in general, an...

Given a graph G = (V,E) with a cost on each edge in E and a prize at each vertex in V, and a target set V′ ⊆ V, the Prize Collecting Steiner Tree (PCST) problem is to find a tree T interconnecting vertices in V′ that has minimum total costs on edges and maximum total prizes at vertices in T. This problem is NP-hard in general, and it is polynomial-...

Some remarks about the Kasperski and Zielinski approximation algorithm for a class of interval data minmax regret combinatorial optimization problems (Algorithm K&Z) are presented. These remarks help to give a better understanding of both the design of the algorithm and its possible applications.