Author:
Aghezzaf El Houssaine,Magnanti Thomas L.,Wolsey Laurence A.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference14 articles.
1. E.H. Aghezzaf, “Optimal constrained rooted subtrees and partitioning problems on tree graphs,” Doctoral thesis, Faculté des Sciences, Université Catholique de Louvain (Louvain-la-Neuve, Belgium, 1992).
2. CORE Discussion Paper;E.H. Aghezzaf,1992
3. E.H. Aghezzaf and L.A. Wolsey, “Modelling piecewise linear concave costs in a tree partitioning problem,”Discrete Applied Mathematics 50 (1994) 101–109.
4. A. Balakrishnan, T.L. Magnanti and R.T. Wong, “A decomposition algorithm for expanding local access telecommunications networks,”Operations Research 43 (1995) 58–76.
5. I. Barany, J. Edmonds and L.A. Wolsey, “Packing and covering a tree by subtrees,”Combinatorica 6 (1986) 245–257.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献