论文信息 - The cost-to-time ratio problem for large or infinite graphs

The cost-to-time ratio problem for large or infinite graphs

Abstract It is an important problem in graph theory and its applications to find the cycles and paths of maximal or minimal cost-to-time ratio in a doubly weighted directed graph. This problem is equivalent to the solution of certain systems of linear inequalities. An algorithm is suggested for the determination of the maximal cost-to-time ratio which works for finite and infinite graphs. It is based on the famous Ford-Bellman algorithm and its extensions by Karp [9] and the author [6;7]. The computational properties of our algorithm mainly depend on the maximal number of arcs of the simple paths, not on the number of vertices of the graph.

Manfred von Golitschek

[1] R. Burkard,et al. Eigenfunctions and optimal orbits , 1984 .

[2] Bennett Fox,et al. Letter to the Editor - Finding Minimal Cost-Time Ratio Circuits , 1969, Oper. Res..

[3] Richard M. Karp,et al. A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..

[4] M. Golitschek. An algorithm for scaling matrices and computing the minimum cycle mean in a digraph , 1980 .

[5] Nimrod Megiddo. Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..

[6] Bennett Fox,et al. FINDING MINIMAL COST-TIME RATIO CIRCUITS, , 1968 .

[7] M. Golitschek. Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones , 1982 .

[8] E. Lawler. Optimal Cycles in Graphs and the Minimal Cost-To-Time Ratio Problem , 1972 .

[9] Richard M. Karp,et al. Parametric shortest path algorithms with an application to cyclic staffing , 1981, Discret. Appl. Math..

[10] R. A. Cuninghame-Green,et al. Describing Industrial Processes with Interference and Approximating Their Steady-State Behaviour , 1962 .

[11] M. Golitschek,et al. Applications of shortest path algorithms to matrix scalings , 1984 .