Packing Steiner trees: A cutting plane algorithm and computational results

被引：0
|
作者：
Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustraße 7, Berlin, 14195, Germany [1 ]
机构：
来源：
Math Program Ser B | / 2卷 / 125-145期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
22
引用
收藏
相关论文
共 50 条
  • [1] Packing Steiner trees: A cutting plane algorithm and computational results
    Grotschel, M
    Martin, A
    Weismantel, R
    [J]. MATHEMATICAL PROGRAMMING, 1996, 72 (02) : 125 - 145
  • [2] Hardness and approximation results for packing Steiner trees
    Cheriyan, J
    Salavatipour, MR
    [J]. ALGORITHMICA, 2006, 45 (01) : 21 - 43
  • [3] Hardness and approximation results for packing steiner trees
    Joseph Cheriyan
    Mohammad R. Salavatipour
    [J]. Algorithmica, 2006, 45 : 21 - 43
  • [4] Hardness and approximation results for packing Steiner trees
    Cheriyan, J
    Salavatipour, MR
    [J]. ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 180 - 191
  • [5] Packing Steiner trees
    Jain, K
    Mahdian, M
    Salavatipour, MR
    [J]. PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 266 - 274
  • [6] Packing Steiner trees
    DeVos, Matt
    McDonald, Jessica
    Pivotto, Irene
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 119 : 178 - 213
  • [7] Packing the Steiner Trees of a Graph
    Petingi, L.
    Talafha, M.
    [J]. NETWORKS, 2009, 54 (02) : 90 - 94
  • [8] A cutting-plane algorithm for the Steiner team orienteering problem
    Assuncao, Lucas
    Mateus, Geraldo Robson
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 135 : 922 - 939
  • [9] Packing Steiner trees on four terminals
    Kriesell, Matthias
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2010, 100 (06) : 546 - 553
  • [10] Packing Steiner trees: Polyhedral investigations
    Grotschel, M.
    Martin, A.
    Weismantel, R.
    [J]. Mathematical Programming, Series A, 1996, 72 (02):
12345