Author:
Ferreira C. E.,Martin A.,de Souza C. C.,Weismantel R.,Wolsey L. A.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference17 articles.
1. E.H. Aghezzaf, “Optimal constrained rooted subtrees and partitioning problems on tree graphs,” Doctoral Thesis, Université Catholique de Louvain, Louvain-la-Neuve, Belgium (1992).
2. F. Barahona, “The max-cut problem in graphs not contractible toK 5”Operations Research Letters 2 (1983) 107–111.
3. F. Barahona and A.R. Mahjoub, “On the cut polytope,”Mathematical Programming 36 (1986) 157–173.
4. S. Chopra and M.R. Rao, “The partition problem,”Mathematical Programming 59 (1993) 87–116.
5. M. Conforti, M.R. Rao and A. Sassano, “The equipartition polytope I,”Mathematical Programming 49 (1990) 49–70.
Cited by
61 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献