Solving the Steiner tree problem in graphs by chaotic search-Reference-Cited by-同舟云学术

Solving the Steiner tree problem in graphs by chaotic search

Author:

Fujita Misa¹,Kimura Takayuki²,Ikeguchi Tohru¹³

Affiliation:

1. Department of Management Science, Graduate School of Engineering, Tokyo University of Science

2. Department of Electrical, Electronics, and Communication Engineering, Faculty of Fundamental Engineering, Nippon Institute of Technology

3. Department of Information and Computer Technology, Faculty of Engineering, Tokyo University of Science

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Rehabilitation,Physical Therapy, Sports Therapy and Rehabilitation,General Medicine

Link

Reference33 articles.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving the Steiner Tree Problem in Graphs with Chaotic Neural Networks;Transactions of the Institute of Systems, Control and Information Engineers;2023-05-15

3. Memetic Strategies for Network Design Problems;Springer Tracts in Nature-Inspired Computing;2021-08-07