Research Article
Applying algorithm finding shortest path in the multiple- weighted graphs to find maximal flow in extended linear multicomodity multicost network
@ARTICLE{10.4108/eai.21-12-2017.153499, author={Chien Tran Quoc and Hung Ho Van}, title={Applying algorithm finding shortest path in the multiple- weighted graphs to find maximal flow in extended linear multicomodity multicost network}, journal={EAI Endorsed Transactions on Industrial Networks and Intelligent Systems}, volume={4}, number={11}, publisher={EAI}, journal_a={INIS}, year={2017}, month={12}, keywords={Graph; Network; Multicommodity Multicost flow; Optimization; Linear Programming.}, doi={10.4108/eai.21-12-2017.153499} }- Chien Tran Quoc
Hung Ho Van
Year: 2017
Applying algorithm finding shortest path in the multiple- weighted graphs to find maximal flow in extended linear multicomodity multicost network
INIS
EAI
DOI: 10.4108/eai.21-12-2017.153499
Abstract
The shortest path finding algorithm is used in many problems on graphs and networks. This article will introduce the algorithm to find the shortest path between two vertices on the extended graph. Next, the algorithm finds the shortest path between the pairs of vertices on the extended graph with multiple weights is developed. Then, the shortest path finding algorithms is used to find the maximum flow on the multicommodity multicost extended network is developed in the article [12].
Copyright © YYYY Author et al., licensed to EAI. This is an open access article distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/3.0/), which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited.
