This paper presents and solves in polynomial time the minimum convex cost dynamic network flow problem, an infinite horizon integer programming problem which involves network flows evolving over time. The model is a finite network in which each arc has an associated transit time for flow to pass through it. An integral amount of flow is to be sent through arcs of the network in each period over...

In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...

This article considers a two-player strategic game for network routing under link disruptions. Player 1 (defender) routes flow through a network to maximize her value of effective flow while facing transportation costs. Player 2 (attacker) simultaneously disrupts one or more links to maximize her value of lost flow but also faces cost of disrupting links. Linear programming duality in zero-sum ...

Definition of Artificial Neural Networks (ANNs) is made by computer scientists, artificial intelligence experts and mathematicians in various dimensions. Many of the definitions explain ANN by referring to graphics instead of giving well explained mathematical definitions; therefore, misleading weighted graphs (as in minimum cost flow problem networks) fit the definition of ANN. This study aims...

We investigate the problem of designing a minimum-cost flow network interconnecting n sources and a single sink, each with known locations in a normed space and with associated flow demands. The network may contain any finite number of additional unprescribed nodes from the space; these are known as the Steiner points. For concave increasing cost functions, a minimum cost network of this sort h...

We investigate how to solve several classical network flow problems using secure multi-party computation. We consider the shortest path problem, the minimum mean cycle problem and the minimum cost flow problem. To the best of our knowledge, this is the first time the two last problems have been addressed in a general multi-party computation setting. Furthermore, our study highlights the complex...

We present a specialized network simplex algorithm for the budget-constrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a second kind of costs associated with each edge, whose total value in a feasible flow is constrained by a given budget B. We present a fully combinatorial description of the algorithm that is based on a novel incorporatio...

Local area networks (LANs) form the basis for worldwide data communication, and, during the last years, performance and size of these networks has been continuously increasing. Inevitably, the configuration of these networks became an important and sophisticated job. This paper presents solutions for the cable management problem, which is a central part of the network configuration process. Amo...

In the minimization of the number of subtours made by an SMD placement machine the following variant of the minimum cost flow problem arised: in a network with n vertices and m arcs a set F of arcs (parametrized arcs) is given and the cost of the flow is equal to the maximum of flow values along the arcs from F . This problem can be solved by a sequence of maximum flow computations in modified ...