Sergio García

Sergio García

Auto-generated profile, based on publicly available information

Sergio García

University of Edinburgh

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 January 2015
Verified
Book Chapter
Closed access
PDF file
SGSergio García
Sergio García
AMAlfredo Marín
Alfredo Marín

9 August 2021 in Sensors
Verified
Journal Article
Open access
PDF file
Xavier CabezasXavier Cabezas
Xavier Cabezas
SGSergio García
Sergio García
Carlos Martin-BarreiroCarlos Martin-Barreiro
Carlos Martin-Barreiro
EDErwin Delgado
Erwin Delgado
Victor LeivaVictor Leiva
Victor Leiva
Healthcare service centers must be sited in strategic locations that meet the immediate needs of patients. The current situation due to the COVID-19 pandemic makes this problem particularly relevant. Assume that each center corresponds to an assigned place for vaccination and that each center uses one or more vaccine brands/laboratories. Then, each patient could choose a center instead of another, because she/he may prefer the vaccine from a more reliable laboratory. This defines an order of preference that might depend on each patient who may not want to be vaccinated in a center where there are only her/his non-preferred vaccine brands. In countries where the vaccination process is considered successful, the order assigned by each patient to the vaccination centers is defined by incentives that local governments give to their population. These same incentives for foreign citizens are seen as a strategic decision to generate income from tourism. The simple plant/center location problem (SPLP) is a combinatorial approach that has been extensively studied. However, a less-known natural extension of it with order (SPLPO) has not been explored in the same depth. In this case, the size of the instances that can be solved is limited. The SPLPO considers an order of preference that patients have over a set of facilities to meet their demands. This order adds a new set of constraints in its formulation that increases the complexity of the problem to obtain an optimal solution. In this paper, we propose a new two-stage stochastic formulation for the SPLPO (2S-SPLPO) that mimics the mentioned pandemic situation, where the order of preference is treated as a random vector. We carry out computational experiments on simulated 2S-SPLPO instances to evaluate the performance of the new proposal. We apply an algorithm based on Lagrangian relaxation that has been shown to be efficient for large instances of the SPLPO. A potential application of this new algorithm to COVID-19 vaccination is discussed and explored based on sensor-related data. Two further algorithms are proposed to store the patient’s records in a data warehouse and generate 2S-SPLPO instances using sensors.

5 January 2018 in Journal of the Operational Research Society
Verified
Journal Article
Closed access
SBStefano Benati
Stefano Benati
SGSergio García
Sergio García
JPJusto Puerto
Justo Puerto
This paper studies the problem of selecting relevant features in clustering problems, out of a data-set in which many features are useless, or masking. The data-set comprises a set U of units, a set V of features, a set R of (tentative) cluster centres and distances for every , , . The feature selection problem consists of finding a subset of features such that the total sum of the distances from the units to the closest centre is minimised. This is a combinatorial optimisation problem that we show to be NP-complete, and we propose two mixed integer linear programming formulations to calculate the solution. Some computational experiments show that if clusters are well separated and the relevant features are easy to detect, then both formulations can solve problems with many integer variables. Conversely, if clusters overlap and relevant features are ambiguous, then even small problems are unsolved. To overcome this difficulty, we propose two heuristic methods to find that, most of the time, one of them, called q-vars, calculates the optimal solution quickly. Then, the q-vars heuristic is combined with the k-means algorithm to cluster some simulated data. We conclude that this approach outperforms other methods for clustering with variable selection that were proposed in the literature.

1 January 2019
Verified
Book Chapter
Closed access
PDF file
SGSergio García
Sergio García
AMAlfredo Marín
Alfredo Marín

1 July 2024 in Operations Research
Verified
Journal Article
Closed access
MDMaxence Delorme
Maxence Delorme
SGSergio García
Sergio García
JGJacek Gondzio
Jacek Gondzio
JKJörg Kalcsics
Jörg Kalcsics
David ManloveDavid Manlove
David Manlove
WPWilliam Pettersson
William Pettersson
New Exact Approaches Tailored for Kidney Exchange Programs with Hierarchical Objectives Kidney exchange programs increase the rate of living donor kidney transplantation. Whereas effective integer programming models aimed at maximizing the total number of transplants have been proposed in the literature, these cannot always be extended to handle a hierarchy of objectives, which is often a requirement in practice. In “New Algorithms for Hierarchical Optimization in Kidney Exchange Programs,” Delorme, García, Gondzio, Kalcsics, Manlove, and Pettersson introduce a new integer programming framework to solve large-size instances of kidney exchange programs. The authors use an ad hoc preprocessing and a reduced-cost variable fixing algorithm to dramatically decrease the size of the models, and they devise a diving algorithm that exploits the hierarchical structure of the problem to significantly reduce the number of integer programs that need to be solved. They also show that it is possible to transition between models as different layers are traversed in the hierarchy, allowing each layer to be solved with the most effective model. Experiments on three different European kidney exchange programs show that running times can be reduced by up to three orders of magnitude.

5 December 2022 in Journal of the Operational Research Society
Verified
Journal Article
Open access
Xavier CabezasXavier Cabezas
Xavier Cabezas
SGSergio García
Sergio García