### 抜粋

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.

元の言語 | English |
---|---|

ホスト出版物のタイトル | IEEE International Conference on Neural Networks - Conference Proceedings |

出版場所 | Piscataway, NJ, United States |

出版者 | IEEE |

ページ | 1867-1870 |

ページ数 | 4 |

巻 | 4 |

出版物ステータス | Published - 1995 |

イベント | Proceedings of the 1995 IEEE International Conference on Neural Networks. Part 1 (of 6) - Perth, Aust 継続期間: 1995 11 27 → 1995 12 1 |

### Other

Other | Proceedings of the 1995 IEEE International Conference on Neural Networks. Part 1 (of 6) |
---|---|

市 | Perth, Aust |

期間 | 95/11/27 → 95/12/1 |

### ASJC Scopus subject areas

- Software

## フィンガープリント Neural networks for solving Constrained Steiner Tree problem' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

*IEEE International Conference on Neural Networks - Conference Proceedings*(巻 4, pp. 1867-1870). IEEE.