Packing Steiner trees: Polyhedral investigations

被引:0
|
作者
Grotschel, M.
Martin, A.
Weismantel, R.
机构
来源
Mathematical Programming, Series A | 1996年 / 72卷 / 02期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [41] Floating Steiner trees
    Sarrafzadeh, M
    Lin, WL
    Wong, CK
    IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (02) : 197 - 211
  • [42] TREES IN POLYHEDRAL GRAPHS
    BARNETTE, D
    CANADIAN JOURNAL OF MATHEMATICS, 1966, 18 (04): : 731 - &
  • [43] Packing in trees
    Henning, MA
    DISCRETE MATHEMATICS, 1998, 186 (1-3) : 145 - 155
  • [44] Algorithmic aspects of Steiner convexity and enumeration of Steiner trees
    Mitre C. Dourado
    Rodolfo A. Oliveira
    Fábio Protti
    Annals of Operations Research, 2014, 223 : 155 - 171
  • [45] Approximations for Steiner Trees with Minimum Number of Steiner Points
    DONGHUI CHEN
    DING-ZHU DU
    XIAO-DONG HU
    GUO-HUI LIN
    LUSHENG WANG
    GUOLIANG XUE
    Journal of Global Optimization, 2000, 18 : 17 - 33
  • [46] Algorithmic aspects of Steiner convexity and enumeration of Steiner trees
    Dourado, Mitre C.
    Oliveira, Rodolfo A.
    Protti, Fabio
    ANNALS OF OPERATIONS RESEARCH, 2014, 223 (01) : 155 - 171
  • [47] On Steiner trees and minimum spanning trees in hypergraphs
    Polzin, T
    Daneshmand, SV
    OPERATIONS RESEARCH LETTERS, 2003, 31 (01) : 12 - 20
  • [48] Packing in trees
    Discrete Math, 1-3 (145-155):
  • [49] Approximations for Steiner trees with minimum number of Steiner points
    Chen, DH
    Du, DZ
    Hu, XD
    Lin, GH
    Wang, LS
    Xue, GL
    THEORETICAL COMPUTER SCIENCE, 2001, 262 (1-2) : 83 - 99
  • [50] Approximations for Steiner trees with minimum number of Steiner points
    Chen, DG
    Du, DZ
    Hu, XD
    Lin, GH
    Wang, LS
    Xue, GL
    JOURNAL OF GLOBAL OPTIMIZATION, 2000, 18 (01) : 17 - 33