Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem-Reference-Cited by-同舟云学术

Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem

Published:2020-08 Issue:2 Volume:38 Page:
ISSN:0266-4720
Container-title:Expert Systems
language:en
Short-container-title:Expert Systems

Author:

Vuppuluri Prem Prakash¹^ORCID,Chellapilla Patvardhan¹

Affiliation:

1. Department of Electrical Engineering, Faculty of Engineering Dayalbagh Educational Institute Agra India

Publisher

Wiley

Subject

Artificial Intelligence,Computational Theory and Mathematics,Theoretical Computer Science,Control and Systems Engineering

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/exsy.12610

Reference56 articles.

1. Minimum weight spanning trees with bounded diameter;Achuthan N. R.;The Australasian Journal of Combinatorics,1992

2. Computational methods for the diameter restricted minimum weight spanning tree problem;Achuthan N. R.;The Australasian Journal of Combinatorics,1994

3. Dense Active Appearance Models Using a Bounded Diameter Minimum Spanning Tree

4. Multicasting in a linear lightwave network

5. OR-Library: Distributing Test Problems by Electronic Mail

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

1. Diameter-Constrained Minimum Spanning Tree Problems: A Survey;2023 International Conference on Information Technology (ICIT);2023-08-09

2. An Improved Strength Pareto Evolutionary Algorithm 2 with Adaptive Crossover Operator for Bi-Objective Distributed Unmanned Aerial Vehicle Delivery;Mathematics;2023-07-28

3. Simulated Annealing Algorithm for the Bounded Diameter Minimum Spanning Tree Problem;Proceedings of the Companion Conference on Genetic and Evolutionary Computation;2023-07-15

4. Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem;Soft Computing;2021-07-08