We compare three network portfolio selection methods; hierarchical clustering trees, minimum spanning trees and neighbor-Nets, with random and industry group selection methods on twelve years of data from the 30 Dow Jones Industrial Average stocks from 2001 to 2013 for very small private...

Interest has been raised by the recent identification of potential savings through collaborative planning in logistics operations. Even though substantial savings can be realized, two key questions exist: (i) how should potential savings be divided among a group of collaborating companies and...

In this paper, we revise some ideas on Graph Theory and develop them to explain and determine three usual concepts of Input–Output Analysis: fundamental products, autonomous sets, and indecomposable matrices.

The length of the Spanish broad gauge network has decreased in the 1956–2006 period. When looking at different railway maps through this period, it seems that the network is offering fewer and fewer alternatives when a line is cut, that is, the network is becoming less and less flexible. The...

In the maximum dispersion problem, a given set of objects has to be partitioned into a number of groups. Each object has a non-negative weight and each group has a target weight, which may be different for each group. In addition to meeting the target weight of each group, all objects assigned...

Centrality measures play an important role in the field of network analysis. In the particular case of social networks, the flow represents the way in which information passes through the network nodes. Freeman et al. (1991) were the first authors to relate centrality measures to network flow...

We consider the optimal ship navigation problem wherein the goal is to find the shortest path between two given coordinates in the presence of obstacles subject to safety distance and turn-radius constraints. These obstacles can be debris, rock formations, small islands, ice blocks, other ships,...

In the Fall of 1953, a translation of a paper of Jenő Egerváry from Hungarian into English combined with a result of Dénes Kőnig provided the basis of a good algorithm for the Linear Assignment Problem. To honor the Hungarian mathematicians whose ideas had been used, it was called the...

The term “hypernetwork” (more precisely, s-hypernetwork and (s, d)-hypernetwork) has been recently adopted to denote some logical structures contained in a directed hypergraph. A hypernetwork identifies the core of a hypergraph model, obtained by filtering off redundant components....

A new class of discrete random fields designed for quick simulation and covariance inference under inhomogeneous conditions is introduced and studied. Simulation of these correlated fields can be done in a single pass instead of relying on multi-pass convergent methods like the Gibbs Sampler or...