Optimizing constrained subtrees of trees
暂无分享,去创建一个
[1] D. S. Johnson,et al. On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees , 1983, Math. Oper. Res..
[2] E. Andrew Boyd,et al. Polyhedral Results for the Precedence-Constrained Knapsack Problem , 1990, Discret. Appl. Math..
[3] Laurence A. Wolsey,et al. Packing and covering a tree by subtrees , 1986, Comb..
[4] Thomas L. Magnanti,et al. A Decomposition Algorithm for Expanding Local Access Telecommunications Networks t , .
[5] Klaus W. Wagner,et al. A characterization of the minimalbasis of the torus , 1986, Comb..
[6] A. Prodon,et al. Optimal subtrees and extensions , 1982 .
[7] Thomas L. Magnanti,et al. A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning , 1995, Oper. Res..
[8] Joseph A. Lukes. Efficient Algorithm for the Partitioning of Trees , 1974, IBM J. Res. Dev..
[9] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .
[10] Said Salhi,et al. Discrete Location Theory , 1991 .
[11] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[12] Laurence A. Wolsey,et al. Modelling piecewise linear concave costs in a tree partitioning problem , 1994, Discret. Appl. Math..
[13] Bhaba R. Sarker,et al. Discrete location theory , 1991 .