Minimum cost network flow problem

We present a wide range of problems concerning minimum cost network flows, and give an overview of the classic linear single commodity Minimum Cost Network Flow Problem (MCNFP) and some other closely related problems, either tractable or intractable. We also discuss state-of-the-art algorithmic approaches and recent advances in the solution methods for the MCNFP. Finally, optimization software packages for the MCNFP are presented.

15p vinguyentuongdanh 19-12-2018 23 2   Download

In this paper, we consider two special cases of this problem which are polynomially solvable. The first is the case with uniform lengths. It is shown that this case transforms to a minimum cost flow problem on an auxiliary network.

15p danhnguyentuongvi27 19-12-2018 31 1   Download

A new dual simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP) is presented. The proposed algorithm belongs to a special “exteriorpoint simplex type” category. Similarly to the classical network dual simplex algorithm (NDSA), this algorithm starts with a dual feasible tree-solution and reduces the primal infeasibility, iteration by iteration.

14p vinguyentuongdanh 19-12-2018 43 0   Download

The efficient design of telecommunication networks has long been a challenging optimization problem. It is made difficult by the conflicting, interdependent requirements necessary to optimize the network’s performance. The goal of the designer is to produce a minimum cost network that allows maximum flow of information (in the form of messages) between multiple source-sink pairs of nodes that simultaneously use the network. An optimum design method must also produce a network topology that efficiently routes these messages within an acceptable amount of time...

21p tienvovan 11-09-2010 105 6   Download