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

Tatsuo Ohtsuki, Satoshi Goto

    Research output: Contribution to journalArticle

    Abstract

    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.

    Original languageEnglish
    Pages (from-to)50-58
    Number of pages9
    JournalNEC Research and Development
    Issue number37-38
    Publication statusPublished - 1975 Apr

      Fingerprint

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    Cite this