CONDE SÁNCHEZ , Eduardo

No description

El concepto de problema de optimización es intuitivamente fácil de entender, consiste en determinar una alternativa óptima frente al criterio seguido de entre un conjunto de posibilidades. Sin embargo la descripción formal de este problema es algo más compleja. Schrijver (1986) define un problema como subconjunto c * x *, donde es un conjunto...

In this paper, we address the problem of locating a series of facilities on a network maximizing the average distance to population centers (assumed to be distributed in the plane) per unit transportation cost (a function of the network distances to users). A finite dominating set is constructed, allowing the resolution of the problem by...

Several multi-criteria-decision-making methodologies assume the existence of weights associated with the different criteria, reflecting their relative importance.One of the most popular ways to infer such weights is the analytic hierarchy process, which constructs first a matrix of pairwise comparisons, from which weights are derived following...

In this note we address the problem of finding the GM-estimator for the location parameter of a univariate random variable. When this problem is non-convex but d.c. one can use a standard covering method, which, in the one-dimensional case has a simple form. In this paper we exploit the structure of the problem in order to obtain d.c....

In this paper we consider a loss system where the arrivals can be classified into different groups according to their arrival rate and expected service time. While the standard admission policy consists of rejecting only those customers who arrive when all servers are busy, we address the problem of finding the optimal static admission policy...

In this note we show by means of a simple example that, if the maximin problem with (nonlinear) concave increasing utility functions is solved by inspecting the extreme points of the (generalized) Voronoi diagram (as usually proposed), one may have to inspect an infinite number of candidate points.

No description

In this paper we present a Mixed Integer Linear Programming model that we developed as part of a pilot study requested by the R&D company Metrolab® in order to design tools for finding solutions for line planning and timetable situations in automated urban metro subway networks. Our model incorporates important factors in public transportation...

We develop a decision-making methodology for hierarchical structures. It provides different decision makers with decision-oriented information based on obtained satisfaction levels. This is specially convenient for public services, where the main goal is user's satisfaction. Our methodology and its associated software (INDI) have been...

Dans cet article on étudie un problème de Weber généralisé où la demande et l'origine qu'on doit localiser peuvent être des régions et on assume qu'elles sont distribuées selon quelque mesure de probabilité dans chaque région. On propose une notation générale pour décrire ces problèmes de localisation et on prouve quelques propriétés qui vont...