Neural networks for solving Constrained Steiner Tree problem

Chotipat Pornavalai, Goutam Chakraborty, Norio Shiratori

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Citations (Scopus)

    Abstract

    Hopfield neural network model for finding an optimal or shortest path between two nodes in a graph was proposed recently in some literatures. In this paper, we present a modified version of Hopfield model to find an optimal tree (least total cost tree) from a source node to a number of destination nodes, where each path from source to a destination must satisfy a constraint condition (delay bound condition). This problem is called Constrained Steiner Tree (CST) problem, and was proved to he a NP-complete. A new adaptive coefficient control method for the proposed Hopfield energy function is also developed. Through computer simulation, it is shown that the proposed model could always find a near-optimal valid solution.

    Original languageEnglish
    Title of host publicationIEEE International Conference on Neural Networks - Conference Proceedings
    Place of PublicationPiscataway, NJ, United States
    PublisherIEEE
    Pages1867-1870
    Number of pages4
    Volume4
    Publication statusPublished - 1995
    EventProceedings of the 1995 IEEE International Conference on Neural Networks. Part 1 (of 6) - Perth, Aust
    Duration: 1995 Nov 271995 Dec 1

    Other

    OtherProceedings of the 1995 IEEE International Conference on Neural Networks. Part 1 (of 6)
    CityPerth, Aust
    Period95/11/2795/12/1

    Fingerprint

    Neural networks
    Hopfield neural networks
    Computer simulation
    Costs

    ASJC Scopus subject areas

    • Software

    Cite this

    Pornavalai, C., Chakraborty, G., & Shiratori, N. (1995). Neural networks for solving Constrained Steiner Tree problem. In IEEE International Conference on Neural Networks - Conference Proceedings (Vol. 4, pp. 1867-1870). Piscataway, NJ, United States: IEEE.

    Neural networks for solving Constrained Steiner Tree problem. / Pornavalai, Chotipat; Chakraborty, Goutam; Shiratori, Norio.

    IEEE International Conference on Neural Networks - Conference Proceedings. Vol. 4 Piscataway, NJ, United States : IEEE, 1995. p. 1867-1870.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Pornavalai, C, Chakraborty, G & Shiratori, N 1995, Neural networks for solving Constrained Steiner Tree problem. in IEEE International Conference on Neural Networks - Conference Proceedings. vol. 4, IEEE, Piscataway, NJ, United States, pp. 1867-1870, Proceedings of the 1995 IEEE International Conference on Neural Networks. Part 1 (of 6), Perth, Aust, 95/11/27.
    Pornavalai C, Chakraborty G, Shiratori N. Neural networks for solving Constrained Steiner Tree problem. In IEEE International Conference on Neural Networks - Conference Proceedings. Vol. 4. Piscataway, NJ, United States: IEEE. 1995. p. 1867-1870
    Pornavalai, Chotipat ; Chakraborty, Goutam ; Shiratori, Norio. / Neural networks for solving Constrained Steiner Tree problem. IEEE International Conference on Neural Networks - Conference Proceedings. Vol. 4 Piscataway, NJ, United States : IEEE, 1995. pp. 1867-1870
    @inproceedings{4a35db1c41014f009cbbd1d6a810585a,
    title = "Neural networks for solving Constrained Steiner Tree problem",
    abstract = "Hopfield neural network model for finding an optimal or shortest path between two nodes in a graph was proposed recently in some literatures. In this paper, we present a modified version of Hopfield model to find an optimal tree (least total cost tree) from a source node to a number of destination nodes, where each path from source to a destination must satisfy a constraint condition (delay bound condition). This problem is called Constrained Steiner Tree (CST) problem, and was proved to he a NP-complete. A new adaptive coefficient control method for the proposed Hopfield energy function is also developed. Through computer simulation, it is shown that the proposed model could always find a near-optimal valid solution.",
    author = "Chotipat Pornavalai and Goutam Chakraborty and Norio Shiratori",
    year = "1995",
    language = "English",
    volume = "4",
    pages = "1867--1870",
    booktitle = "IEEE International Conference on Neural Networks - Conference Proceedings",
    publisher = "IEEE",

    }

    TY - GEN

    T1 - Neural networks for solving Constrained Steiner Tree problem

    AU - Pornavalai, Chotipat

    AU - Chakraborty, Goutam

    AU - Shiratori, Norio

    PY - 1995

    Y1 - 1995

    N2 - Hopfield neural network model for finding an optimal or shortest path between two nodes in a graph was proposed recently in some literatures. In this paper, we present a modified version of Hopfield model to find an optimal tree (least total cost tree) from a source node to a number of destination nodes, where each path from source to a destination must satisfy a constraint condition (delay bound condition). This problem is called Constrained Steiner Tree (CST) problem, and was proved to he a NP-complete. A new adaptive coefficient control method for the proposed Hopfield energy function is also developed. Through computer simulation, it is shown that the proposed model could always find a near-optimal valid solution.

    AB - Hopfield neural network model for finding an optimal or shortest path between two nodes in a graph was proposed recently in some literatures. In this paper, we present a modified version of Hopfield model to find an optimal tree (least total cost tree) from a source node to a number of destination nodes, where each path from source to a destination must satisfy a constraint condition (delay bound condition). This problem is called Constrained Steiner Tree (CST) problem, and was proved to he a NP-complete. A new adaptive coefficient control method for the proposed Hopfield energy function is also developed. Through computer simulation, it is shown that the proposed model could always find a near-optimal valid solution.

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

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

    M3 - Conference contribution

    VL - 4

    SP - 1867

    EP - 1870

    BT - IEEE International Conference on Neural Networks - Conference Proceedings

    PB - IEEE

    CY - Piscataway, NJ, United States

    ER -