Author:
Grötschel M.,Martin A.,Weismantel R.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference11 articles.
1. M.R. Garey and D.S. Johnson, “The rectilinear Steiner tree problem is -complete,”SIAM Journal on Applied Mathematics 32 (1977) 826–834.
2. M. Grötschel, A. Martin and R. Weismantel, “Routing in grid graphs by cutting planes,”Zeitschrift für Operations Research 41 (1995) 255–275.
3. M. Grötschel, A. Martin and R. Weismantel, “Packing Steiner trees: a cutting plane algorithm and computational results,”Mathematical Programming 72 (1996) (this issue).
4. M. Grötschel, A. Martin and R. Weismantel, “Packing Steiner trees: further facets,”European Journal on Combinatorics, to appear.
5. M. Grötschel and C.L. Monma, “Integer polyhedra associated with certain network design problems with connectivity constraints,”SIAM Journal on Discrete Mathematics 3 (1990) 502–523.
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献