Forest management aims at building ecological networks that minimize the impacts on timber production. We formalize the construction of ecological networks in forest environments as the optimal control dynamic graph-theoretic problem. The ecological network is based on a set of bioreserves and...

Marengo and Pasquali (2008) present a model of object construction in majority voting and show that, in general, by appropriate changes of such bundles, different social outcomes may be obtained. In this paper we extend and generalize this approach by providing a geometric model of individual...

Structural analysis deals with economic systems as defined by the set of industries and the relationships between them. However, multi-sectoral models are often limited: when studying economic systems empirically it is difficult to distinguish a priori the subset of basic or important...

En la actualidad, la gestión de rutas es un aspecto fundamental en las empresas cuya actividad se basa principalmente en el transporte, ya que supone elevados costes de carburantes, mano de obra, etc. En este artículo, se estudia el caso de la empresa Semacaf Máquinas de Café S.L.,...

A widely known algorithm for ¯nding the shortest path in a network is Bidirectional A*. The version of bidirectional A* that is considered the most appropriate hitherto, uses so-called balanced heuristic estimates. In this paper, we focus on symmetric heuristic estimates. First, we show that...

The notion of transit function is introduced to present a unifying approach for results and ideas on intervals, convexities and betweenness in graphs and posets. Prime examples of such transit functions are the interval function I and the induced path function J of a connected graph. Another...

We have posed a simple but interesting graph theoretic problem and posited a heuristic solution procedure, which we have christened as Vectored Route-lenght Minimization (VeRMin). Basically, it constitutes a re-casting of the classical "shortest route" problem in a strictly Euclidean space. We...

We consider bargaining in a bipartite network of buyers and sellers, who can only trade with the limited number of people with whom they are connected. Such networks could arise due to proximity issues or restricted communication flows, as with information transmission of job openings, business...