Extended Linear Multi-Commodity Multicost Network and Maximal Flow Limited Cost Problems
International Journal of Computer Networks & Communications (IJCNC), 10 (1):
79-93 (January 2018)DOI: 10.5121/ijcnc.2018.10106
Abstract
The Graph is a powerful mathematical tool applied in many fields as transportation, communication, informatics, economy, … In an ordinary graph, the weights of edges and vertexes are considered independently where the length of a path is the sum of weights of the edges and the vertexes on this path. However, in many practical problems, weights at a vertex are not the same for all paths passing this vertex
but depend on coming and leaving edges. The presented paper develops a model of the extended linear multi-commodity multi-cost network that can be more exactly and effectively applied to model many practical problems. Then, maximal limit cost flow problems are modeled as implicit linear programming problems. On the base of dual theory in linear programming, an effective approximate algorithm is developed