咨询与建议

限定检索结果

文献类型

  • 1 篇 会议

馆藏范围

  • 1 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1 篇 工学
    • 1 篇 计算机科学与技术...

主题

  • 1 篇 minimum routing ...
  • 1 篇 hybrid genetic a...
  • 1 篇 clustered minimu...

机构

  • 1 篇 tech univ cluj n...

作者

  • 1 篇 petrovan adrian
  • 1 篇 teglas bogdan
  • 1 篇 sabo cosmin
  • 1 篇 pop petrica c.

语言

  • 1 篇 英文
检索条件"主题词=minimum routing tree problem"
1 条 记 录,以下是1-10 订阅
排序:
Solving the Clustered minimum routing tree problem Using Prufer-Coding Based Hybrid Genetic Algorithms  19th
Solving the Clustered Minimum Routing Tree Problem Using Pru...
收藏 引用
19th International Conference on Hybrid Artificial Intelligence Systems
作者: Sabo, Cosmin Teglas, Bogdan Pop, Petrica C. Petrovan, Adrian Tech Univ Cluj Napoca North Univ Ctr Baia Mare Dr V Babes 62A Baia Mare 430083 Romania
The clustered minimum routing tree problem (CluMRTP) extends the classical minimum routing tree problem by considering a graph with vertices divided into a given number of clusters. The scope of the CluMRTP is to find... 详细信息
来源: 评论