2005Yunchou yu guanliRequires access

A Network Algorithm for Solving the Transportation Problem

Hui Liu

Open publisher page 0 citations

Abstract

This paper concerns two methods of acquiring primitive solution on network for transportation problem, and the primitive solution is almost optimal solution for solving the transportation problem with time constrainted. An example is given to demonstrate the use of the algorithm.

About this research paper

What this paper is about

This paper concerns two methods of acquiring primitive solution on network for transportation problem, and the primitive solution is almost optimal solution for solving the transportation problem with time constrainted. An example is given to demonstrate the use of the algorithm.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper concerns two methods of acquiring primitive solution on network for transportation problem, and the primitive solution is almost optimal solution for solving the transportation problem with time constrainted. An example is given to demonstrate the use of the algorithm.

Key concepts: Transportation theory, Flow network, Computer science, Algorithm, Mathematical optimization, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
A Network Algorithm for Solving the Transportation Problem — Research Paper | ScholarLens