A network algorithm for the transportation problem with a shortest time limit and its additional information

A network algorithm for the transportation problem with a shortest time limit and its additional information

0.00 Avg rating0 Votes
Article ID: iaor20051154
Country: China
Volume: 12
Issue: 6
Start Page Number: 62
End Page Number: 66
Publication Date: Dec 2003
Journal: Operations Research and Management Science
Authors:
Abstract:

The paper introduces a network algorithm of the transportation problem of the shortest time limit which is based on the Ford–Fulkerson algorithm, and therefore points out the meanings of its additional information and its application value in business, especially in the problem of the minimum time needed to transport a given goods.

Reviews

Required fields are marked *. Your email address will not be published.