We apply statistical physics to study the task of resource allocation in random networks with limited bandwidths for the transportation of resources along the links. We derive algorithms which searches the optimal solution without the need of a global optimizer. For networks with uniformly high connectivity, the resource shortage of a node becomes a well-defined function of its capacity. An eff...

We have sampled the artist social network of Myspace and to it applied the pairwise relational connectivity measure Minimum cut/Maximum flow. These values are then compared to a pairwise acoustic Earth Mover’s Distance measure and the relationship is discussed. Further, a means of constructing playlists using the maximum flow value to exploit both the social and acoustic distances is realized.

In this paper we consider the location of stops along the edges of an already existing public transportation network. This can be the introduction of bus stops along some given bus routes, or of railway stations along the tracks in a railway network. The positive effect of new stops is given by the better access of the customers to the public transport network, while the traveling time increase...

We present two efficient algorithms for solving the electric power transaction problem. The electric power transaction problem appears when maximizing the social benefit on electric power transactions among some private companies. The problem is a special case of the minimum cost flow problem defined on a network with many leaves, where each leaf corresponds to a (private) company who wants to ...

We consider a generalization of the maximum flow problem in which the amounts of flow entering and leaving an arc are linearly related. More precisely, if x(e) units of flow enter an arc e, x(e)γ(e) units arrive at the other end. For instance, nodes of the graph can correspond to different currencies, with the multipliers being the exchange rates. We require conservation of flow at every node e...

Maximum Flow Network Interdiction Problem (MFNIP) is known to be strongly NP-hard problem. We solve a simple form of MFNIP in polynomial time. We review the reduction of MFNIP from the clique problem. We propose a polynomial time solution to the Clique Problem.

In the present work an attempt is being made to reduce the Maximum Flow Network Interdiction Problem (MFNIP) in to the Subset Sum Problem so as to get some algorithms solvable in polynomial time. Previously developed algorithms are either applicable to some special cases of MFNIP or they do not have a constant performance guarantee. Our reduction has paved the way towards the development of ful...

We consider a minimum-cost dynamic network-flow problem on a very special network. This network flow problem models an infinite-horizon, lot-sizing problem with deterministic demand and periodic data. We permit two different objectives: minimize long-run average-cost per period and minimize the discounted cost. In both cases we give polynomial algorithms when certain arc costs are fixed charge ...

Ravindra K. Ahuja and Dorit S. Hochbaum Abstract In this paper, we study capacitated dynamic lot sizing problems with or without backorders, under the assumption that production costs are linear, that is, there are no set up costs. These two dynamic lot sizing problems (with or without backorders) are minimum cost flow problems on an underlying network that possess a special structure. We show ...

Flow allocation problem is one of the important steps in reliability evaluation or optimization of a stochastic flow network. In a single source single sink networks it is easy to determine the flow on each path by using one of best known methods. While, in the case of multisource multisink flow network the file allocation problem becomes more complicated and few studies have dealt with it. Thi...