5 research outputs found
Robust mean absolute deviation problems on networks with linear vertex weights
This article deals with incorporating the mean absolute
deviation objective function in several robust single facility
location models on networks with dynamic evolution
of node weights, which are modeled by means of linear
functions of a parameter. Specifically, we have considered
two robustness criteria applied to the mean absolute
deviation problem: the MinMax criterion, and the MinMax
regret criterion. For solving the corresponding optimization
problems, exact algorithms have been proposed and
their complexities have been also analyzed.Ministerio de Ciencia e Innovación MTM2007-67433-C02-(01,02)Ministerio de Ciencia e Innovación MTM2009-14243Ministerio de Ciencia e Innovación MTM2010-19576-C02-(01,02)Ministerio de Ciencia e Innovación DE2009-0057Junta de Andalucía P09-TEP-5022Junta de Andalucía FQM-584
Mathematical optimization models for reallocating and sharing health equipment in pandemic situations
In this paper we provide a mathematical programming based decision tool to optimally
reallocate and share equipment between different units to efficiently equip
hospitals in pandemic emergency situations under lack of resources. The approach is
motivated by the COVID-19 pandemic in which many Heath National Systems were
not able to satisfy the demand of ventilators, sanitary individual protection equipment
or different human resources. Our tool is based in two main principles: (1) Part
of the stock of equipment at a unit that is not needed (in near future) could be shared
to other units; and (2) extra stock to be shared among the units in a region can be
efficiently distributed taking into account the demand of the units. The decisions are
taken with the aim of minimizing certain measures of the non-covered demand in a
region where units are structured in a given network. The mathematical programming
models that we provide are stochastic and multiperiod with different robust
objective functions. Since the proposed models are computationally hard to solve,
we provide a divide-et-conquer math-heuristic approach. We report the results of
applying our approach to the COVID-19 case in different regions of Spain, highlighting
some interesting conclusions of our analysis, such as the great increase of
treated patients if the proposed redistribution tool is applied.Spanish Ministerio de Ciencia e Innovacion, Agencia Estatal de Investigacion/FEDER PID2020-114594GB-C21Junta de Andalucia SEJ-584
FQM-331
P18-FR-1422
US-1256951
P18-FR-2369Spanish Government PEJ2018-002962-ADoctoral Program in Mathematics at the Universidad of GranadaProyect NetMeetData (Fundacion BBVA - Big Data)IMAG-Maria de Maeztu grant CEX2020-001105-M/AEICenter for Forestry Research & Experimentation (CIEF)European Commission CIGE/2021/16
Sharp Bounds on Davenport-Schinzel Sequences of Every Order
One of the longest-standing open problems in computational geometry is to
bound the lower envelope of univariate functions, each pair of which
crosses at most times, for some fixed . This problem is known to be
equivalent to bounding the length of an order- Davenport-Schinzel sequence,
namely a sequence over an -letter alphabet that avoids alternating
subsequences of the form with length
. These sequences were introduced by Davenport and Schinzel in 1965 to
model a certain problem in differential equations and have since been applied
to bounding the running times of geometric algorithms, data structures, and the
combinatorial complexity of geometric arrangements.
Let be the maximum length of an order- DS sequence over
letters. What is asymptotically? This question has been answered
satisfactorily (by Hart and Sharir, Agarwal, Sharir, and Shor, Klazar, and
Nivasch) when is even or . However, since the work of Agarwal,
Sharir, and Shor in the mid-1980s there has been a persistent gap in our
understanding of the odd orders.
In this work we effectively close the problem by establishing sharp bounds on
Davenport-Schinzel sequences of every order . Our results reveal that,
contrary to one's intuition, behaves essentially like
when is odd. This refutes conjectures due to Alon et al.
(2008) and Nivasch (2010).Comment: A 10-page extended abstract will appear in the Proceedings of the
Symposium on Computational Geometry, 201