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

    Iterative methods
    Linear programming

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    Cite this

    SIMPLEX ALGORITHM ON A LINEAR GRAPH - A UNIFIED VIEW OF THE EXTREMAL PATH AND CUTSET PROBLEMS ON A GRAPH. / Ohtsuki, Tatsuo; Goto, Satoshi.

    In: NEC Research and Development, No. 37-38, 04.1975, p. 50-58.

    Research output: Contribution to journalArticle

    @article{d4175b269cd344afa52db353c75b2a3a,
    title = "SIMPLEX ALGORITHM ON A LINEAR GRAPH - A UNIFIED VIEW OF THE EXTREMAL PATH AND CUTSET PROBLEMS ON A GRAPH.",
    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.",
    author = "Tatsuo Ohtsuki and Satoshi Goto",
    year = "1975",
    month = "4",
    language = "English",
    pages = "50--58",
    journal = "NEC Research and Development",
    issn = "0048-0436",
    publisher = "NEC Media Products Ltd.",
    number = "37-38",

    }

    TY - JOUR

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

    AU - Ohtsuki, Tatsuo

    AU - Goto, Satoshi

    PY - 1975/4

    Y1 - 1975/4

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=0016490035&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0016490035&partnerID=8YFLogxK

    M3 - Article

    AN - SCOPUS:0016490035

    SP - 50

    EP - 58

    JO - NEC Research and Development

    JF - NEC Research and Development

    SN - 0048-0436

    IS - 37-38

    ER -