Evolutionary algorithms and simulated annealing in the topological configuration of the spanning tree

被引:0
|
作者
Sadegheih, A. [1 ]
机构
[1] Department of Industrial Engineering, University of Yazd, P.O. Box 89195-741, Yazd, Iran
来源
WSEAS Transactions on Systems | 2008年 / 7卷 / 02期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:114 / 124
相关论文
共 50 条
  • [31] COMPUTATIONAL EXPERIENCE WITH MINIMUM SPANNING TREE ALGORITHMS
    JARVIS, JP
    WHITED, DE
    OPERATIONS RESEARCH LETTERS, 1983, 2 (01) : 36 - 41
  • [32] Approximation Algorithms for Quickest Spanning Tree Problems
    Refael Hassin
    Asaf Levin
    Algorithmica , 2005, 41 : 43 - 52
  • [33] Algorithms for the optimum communication spanning tree problem
    Sharma, P
    ANNALS OF OPERATIONS RESEARCH, 2006, 143 (01) : 203 - 209
  • [34] Algorithms for the optimum communication spanning tree problem
    Prabha Sharma
    Annals of Operations Research, 2006, 143 : 203 - 209
  • [35] Approximation algorithms for quickest spanning tree problems
    Hassin, R
    Levin, A
    ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 395 - 402
  • [36] Decomposable algorithms for computing minimum spanning tree
    Khedr, A
    Bhatnagar, R
    DISTRIBUTED COMPUTING: IWDC 2003, 2003, 2918 : 33 - 44
  • [37] Minimum spanning tree based clustering algorithms
    Grygorash, Oleksandr
    Zhou, Yan
    Jorgensen, Zach
    ICTAI-2006: EIGHTEENTH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, : 73 - +
  • [38] Genetic Algorithms for Balanced Spanning Tree Problem
    Moharam, Riham
    Morsy, Ehab
    Ismail, Ismail A.
    PROCEEDINGS OF THE 2015 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS, 2015, 5 : 537 - 545
  • [39] Approximation algorithms for quickest spanning tree problems
    Hassin, R
    Levin, A
    ALGORITHMICA, 2005, 41 (01) : 43 - 52
  • [40] Parallel algorithms for minimum spanning tree problem
    Ahrabian, H
    Nowzari-Dalini, A
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2002, 79 (04) : 441 - 448