Neural networks for solving Constrained Steiner Tree problem

Chotipat Pornavalai*, Goutam Chakraborty, Norio Shiratori

*Corresponding author for this work

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

    2 Citations (Scopus)


    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
    Number of pages4
    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


    OtherProceedings of the 1995 IEEE International Conference on Neural Networks. Part 1 (of 6)
    CityPerth, Aust

    ASJC Scopus subject areas

    • Software


    Dive into the research topics of 'Neural networks for solving Constrained Steiner Tree problem'. Together they form a unique fingerprint.

    Cite this