SIMPLEX ALGORITHM ON A LINEAR GRAPH - A UNIFIED VIEW OF THE EXTREMAL PATH AND CUTSET PROBLEMS ON A GRAPH.

Tatsuo Ohtsuki, Satoshi Goto

    研究成果: Article

    抜粋

    A unified view of the extremum path and cutset problems in a graph has been presented, and a new algorithm to solve them has been proposed. All these problems have been solved by elementary tree transformations, a graph-theoretical iterative method. The relation between linear programming and the graph-theoretical method is considered. In the approach presented, the optimum can be expressed in the form of a general solution.

    元の言語English
    ページ(範囲)50-58
    ページ数9
    ジャーナルNEC Research and Development
    発行部数37-38
    出版物ステータスPublished - 1975 4

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    フィンガープリント SIMPLEX ALGORITHM ON A LINEAR GRAPH - A UNIFIED VIEW OF THE EXTREMAL PATH AND CUTSET PROBLEMS ON A GRAPH.' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用