Search results for "Maximization"

Social Influence Maximization in Hypergraphs

2021

This work deals with a generalization of the minimum Target Set Selection (TSS) problem, a key algorithmic question in information diffusion research due to its potential commercial value. Firstly proposed by Kempe et al., the TSS problem is based on a linear threshold diffusion model defined on an input graph with node thresholds, quantifying the hardness to influence each node. The goal is to find the smaller set of items that can influence the whole network according to the diffusion model defined. This study generalizes the TSS problem on networks characterized by many-to-many relationships modeled via hypergraphs. Specifically, we introduce a linear threshold diffusion process on such …

Banking Competition, Collateral Constraints and Optimal Monetary Policy

2013

We analyze optimal monetary policy in a model with two distinct financial frictions. First, borrowing is subject to collateral constraints. Second, credit flows are intermediated by monopolistically competitive banks, thus giving rise to endogenous lending spreads. We show that, up to a second order approximation, welfare maximization is equivalent to stabilization of four goals: inflation, output gap, the consumption gap between constrained and unconstrained agents, and the distribution of the collateralizable asset between both groups. Following both financial and non-financial shocks, the optimal monetary policy commitment implies a short-run trade-off between stabilization goals. Such p…

Deterministic Linkage as a Preceding Filter for Other Record Linkage Methods

2015

Deterministic record linkage (RL) is frequently regarded as a rival to more sophisticated strategies like probabilistic RL. We investigate the effect of combining deterministic linkage with other linkage techniques. For this task, we use a simple deterministic linkage strategy as a preceding filter: a data pair is classified as ‘match' if all values of attributes considered agree exactly, otherwise as ‘nonmatch'. This strategy is separately combined with two probabilistic RL methods based on the Fellegi–Sunter model and with two classification tree methods (CART and Bagging). An empirical comparison was conducted on two real data sets. We used four different partitions into training data a…

Accounting for haplotype phase uncertainty in linkage disequilibrium estimation

2007

The characterization of linkage disequilibrium (LD) is applied in a variety of studies including the identification of molecular determinants of the local recombination rate, the migration and population history of populations, and the role of positive selection in adaptation. LD suffers from the phase uncertainty of the haplotypes used in its calculation, which reflects limitations of the algorithms used for haplotype estimation. We introduce a LD calculation method, which deals with phase uncertainty by weighting all possible haplotype pairs according to their estimated probabilities as evaluated by PHASE. In contrast to the expectation-maximization (EM) algorithm as implemented in the HA…

A novel heuristics-based energy management system for a multi-carrier hub enriched with solid hydrogen storage

2014

In this paper, an efficient optimization algorithm for the energy management of a grid-connected energy hub plant is proposed. The Simulated Annealing algorithm is adopted for the solution of the energy management problem aiming at the profit maximization for the owner of the energy hub plant. The use of a heuristic algorithm was required by the non-linearity of the efficiencies of each component in the energy transformation stages. The proposed heuristics is applied to a large energy hub, corresponding to the simulation of the test-bed that is being designed and developed inside the ongoing INGRID European research project.

A review on discrete diversity and dispersion maximization from an OR perspective

2022

Abstract The problem of maximizing diversity or dispersion deals with selecting a subset of elements from a given set in such a way that the distance among the selected elements is maximized. The definition of distance between elements is customized to specific applications, and the way that the overall diversity of the selected elements is computed results in different mathematical models. Maximizing diversity by means of combinatorial optimization models has gained prominence in Operations Research (OR) over the last two decades, and constitutes nowadays an important area. In this paper, we review the milestones in the development of this area, starting in the late eighties when the first…

DEA-like Models for the Efficiency Evaluation of Hierarchically Structured Units

2004

Abstract The knowledge of the internal structure of decision making units (DMUs) gives further insights with respect to the “black box” perspective when considering data envelopment analysis models. We present one-level and two-level hierarchical structures of the DMUs under evaluation. Each unit is composed of consecutive stages of parallel subunits all with constant returns to scale. In particular, the maximization of the relative efficiency of a DMU is studied. For the two-stage situation, different degrees of coordination among the subunits of the hierarchical levels are discussed. When some form of coordination has to be guaranteed, we introduce balancing constraints and we compare two…

On properties of the iterative maximum likelihood reconstruction method

1989

In this paper, we continue our investigations6 on the iterative maximum likelihood reconstruction method applied to a special class of integral equations of the first kind, where one of the essential assumptions is the positivity of the kernel and the given right-hand side. Equations of this type often occur in connection with the determination of density functions from measured data. There are certain relations between the directed Kullback–Leibler divergence and the iterative maximum likelihood reconstruction method some of which were already observed by other authors. Using these relations, further properties of the iterative scheme are shown and, in particular, a new short and elementar…

Iterative continuous maximum-likelihood reconstruction method

1992

Non-dominated “trade-off” solutions in television scheduling optimization

2014

The main approaches for the television scheduling design are commonly based on the ratings or revenues maximization objective, and thus, only a single optimal solution can be obtained, corresponding to the best result for the considered objective. Therefore, these approaches lead up to the alternative solutions loss which, even if less effective from the ratings or revenues maximization viewpoint, may be more suitable for the decision maker because of better compromise in relation to factors influencing the decision process. Specifically, such a compromise could be achieved through a suitable “trade-off” between these factors, with reference to the decision context in which the decision mak…