A dual method for the transportation problem using shortest path updates

A dual method for the transportation problem using shortest path updates

0.00 Avg rating0 Votes
Article ID: iaor19941966
Country: Singapore
Volume: 7
Issue: 2
Start Page Number: 127
End Page Number: 140
Publication Date: Nov 1990
Journal: Asia-Pacific Journal of Operational Research
Authors: ,
Keywords: networks: path
Abstract:

In this paper the authors propose a method for solving the transportation problem by building the problem row by row. They use shortest path routes between row nodes for updating the solution. The method is a dual method in that it progresses through primal infeasible/dual feasible solutions.

Reviews

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