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 条
  • [21] A new heuristic for the Euclidean Steiner Tree Problem in Rn
    Pinto, Renan Vicente
    Maculan, Nelson
    TOP, 2023, 31 (02) : 391 - 413
  • [22] A Heuristic Algorithm for the Prize Collecting Steiner Tree Problem
    Hosokawa, Y.
    Chiba, E.
    2014 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2014, : 99 - 102
  • [23] An heuristic for the edge-survivable General Steiner Problem
    Sartor Del Giudice, Pablo
    Robledo Amoza, Franco
    SOR'11 PROCEEDINGS: THE 11TH INTERNATIONAL SYMPOSIUM ON OPERATIONAL RESEARCH IN SLOVENIA, 2011, : 67 - 72
  • [24] A robust and scalable algorithm for the Steiner problem in graphs
    Pajor, Thomas
    Uchoa, Eduardo
    Werneck, Renato F.
    MATHEMATICAL PROGRAMMING COMPUTATION, 2018, 10 (01) : 69 - 118
  • [25] A 1.598 approximation algorithm for the Steiner problem in graphs
    Hougardy, S
    Prömel, HJ
    PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 448 - 453
  • [26] AN EDGE ELIMINATION TEST FOR THE STEINER PROBLEM IN GRAPHS
    DUIN, CW
    VOLGENANT, A
    OPERATIONS RESEARCH LETTERS, 1989, 8 (02) : 79 - 83
  • [27] New benchmark instances for the Steiner problem in graphs
    Rosseti, I
    de Aragao, MP
    Ribeiro, CC
    Uchoa, E
    Werneck, RF
    METAHEURISTICS: COMPUTER DECISION-MAKING, 2004, 86 : 601 - +
  • [28] Homogeneously orderable graphs and the Steiner tree problem
    Brandstadt, A
    Dragan, FF
    Nicolai, F
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1995, 1017 : 381 - 395
  • [29] A branch and cut algorithm for the Steiner problem in graphs
    Lucena, A
    Beasley, JE
    NETWORKS, 1998, 31 (01) : 39 - 59
  • [30] The Steiner tree problem on graphs: Inapproximability results
    Chlebik, Miroslav
    Chlebikova, Janka
    THEORETICAL COMPUTER SCIENCE, 2008, 406 (03) : 207 - 214
12345