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

    • 電子工学および電気工学

    フィンガープリント

    「SIMPLEX ALGORITHM ON A LINEAR GRAPH - A UNIFIED VIEW OF THE EXTREMAL PATH AND CUTSET PROBLEMS ON A GRAPH.」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル