ScholarLens Back to search
1973•Mathematische Operationsforschung StatistikRequires access

On the determination of the shortes path in a network having gains

András Bakó

Open publisher page 5 citations

Abstract

The shortest path problem has been solved by FORD and FULKERSON [1] using a network method. COOK and HOLSEY [2] have given an algorithm for a generalization of te problem by applying dynamic programming to a network having time dependent edges. E. KLAFSZKY [3] has described a procedure using the flow method of FORD and FULKERSON which gives the shortest path in addition to the length of the path. CHARNES and RAIKE [4] applied linear programming to another generalization of te shortest path problem. This generalized problem is dealt with in this paper. The problem can be solved by the FORD and FULKERSON's procedure following the train of thought described by E. KLAFSZKY.

About this research paper

What this paper is about

The shortest path problem has been solved by FORD and FULKERSON [1] using a network method. COOK and HOLSEY [2] have given an algorithm for a generalization of te problem by applying dynamic programming to a network having time dependent edges. E. KLAFSZKY [3] has described a procedure using the flow method of FORD and FULKERSON which gives the shortest path in addition to the length of the path. CHARNES and RAIKE [4] applied linear programming to another generalization of te shortest path problem. This generalized problem is dealt with in this paper. The problem can be solved by the FORD and FULKERSON's procedure following the train of thought described by E. KLAFSZKY.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

The shortest path problem has been solved by FORD and FULKERSON [1] using a network method. COOK and HOLSEY [2] have given an algorithm for a generalization of te problem by applying dynamic programming to a network having time dependent edges. E. KLAFSZKY [3] has described a procedure using the flow method of FORD and FULKERSON which gives the shortest path in addition to the length of the path. CHARNES and RAIKE [4] applied linear programming to another generalization of te shortest path problem. This generalized problem is dealt with in this paper. The problem can be solved by the FORD and FULKERSON's procedure following the train of thought described by E. KLAFSZKY.

Key concepts: Shortest path problem, Constrained Shortest Path First, K shortest path routing, Generalization, Path (computing), Computer science, Yen's algorithm, Mathematical optimization

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On the determination of the shortes path in a network having gains — Research Paper | ScholarLens