STEINER PROBLEM IN GRAPHS - HEURISTIC METHODS

被引：67
|
作者：
VOSS, S
机构：
[1] FB 1/FG Operations Research, Technische Hochschule Darmstadt, D-6100 Darmstadt
来源：
DISCRETE APPLIED MATHEMATICS | 1992年 / 40卷 / 01期
关键词：
D O I：
10.1016/0166-218X(92)90021-2
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Real world problems arising in the layout of connection structures in networks as e.g. in VLSI design may often be decomposed into a number of well-known combinatorial optimization problems. Steiner's problem in graphs is included within this context. According to its complexity one is interested in developing efficient heuristic algorithms to find good approximate solutions. Here a comparison of various heuristic methods for Steiner's problem in graphs is presented.
引用
收藏
页码：45 / 72
页数：28
相关论文
共 50 条
12345