Several optimalization algorithms have been proposed for the solution of the basic network flow algorithms, such as the minimal and the multiterminal minimal path of a network having cost (distance) function, maximal flow of a capacitated network. In this paper we present these algorithms in a special network in which on the edges a gain function is given. On the edge (x,y) of the network a t(x,y) transportation cost is defined. In the course of the transportation on the edge (x,y) the goods loose a part of there weight. If one unit of goods is transported from point x to point y then k(x,y) unite of goods arrive at point y, where 0 Show more

Open Access: Yes

DOI: 10.1007/978-3-642-03737-5_32