The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem

Networks

Volumn 31, Issue 4, 1998, Pages 205-216

  Shaw, Dong X ^a   Cho, Geon ^b  

^a SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

^b Chonnam National University   (South Korea)

Author keywords

Branch and bound; Critical item; Tree knapsack

Indexed keywords

EID: 0002016384     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199807)31:4<205::AID-NET1>3.0.CO;2-H     Document Type: Article

References (20)

1. E. H. Aghezzaf, T. L. Magnanti, and L. A. Wolsey, Optimizing constrained subtrees of trees. Technical report, Center for Operations Research and Econometrics, Universite Catholique De Louvain, Belgium (1992).
2. A. Balakrishnan, T. L. Magnanti, and R. T. Wong, A decomposition algorithm for expanding local access telecommunications networks. Oper. Res. 43 (1995) 43-57.
3. E. Balas and E. Zemel, An algorithm for large zero-one knapsack problem. Oper. Res. 28 (1980) 1130-1154.
4. D. Bienstock, A lot-sizing problem on trees, related to network design. Math. Oper. Res. 18 (1993) 402-422.
5. G. Cho and D. X. Shaw, A depth-first dynamic programming procedure for tree knapsack and tree partitioning problems. INFORMS J. Comp. (1998) to appear.
6. M. Grötschel and O. Holland, Solution of large-scale symmetric traveling salesman problems. Math. Program. 51 (1991) 141-202.
7. M. Grötschel, C. L. Monma, and M. Stoer, Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Oper. Res. 40 (1992) 309-330.
8. E. Horowitz and S. Sahni, Computing partitions with applications to the knapsack problem. J. ACM 21 (1974) 277-292.
9. D. S. Johnson and K. A. Niemi, On knapsacks, partitions, and a new dynamic programming technique for trees. Math. Oper. Res. 8 (1983) 1-14.
10. E. L. Lawler, Fast approximation algorithms for knapsack problems. Matk. Oper. Res. 4 (1979) 339-356.
11. J. A. Lukes, Efficient algorithm for the partitioning of trees. IBM J. Res. Dev. 18 (1974) 214-224.
12. T. L. Magnanti and L. A. Wolsey, Optimal trees. Technical report, CORE, Universite Catholique de Louvain (1994).
13. S. Martello and P. Toth, Algorithms for knapsack problems. Ann. Discr. Math. 31 (1987) 213-258.
14. S. Martello and P. Toth, Knapsack problems. Technical report, Wiley, New York (1990).
15. H. Müller-Merbach, An improved upper bound for the zero-one knapsack problem: A note on the paper by martelo and toth. Eur. J. Oper. Res. 2 (1978) 212-213.
16. G. L. Nemhauser and L. A. Wolsey, Integer and combinatorial optimization. Technical report, Wiley, New York (1988).
17. M. W. Padberg and G. Rinaldi, Optimization of a 532-city symmetric traveling salesman problem by brach-and-cut. Technical report, New York University (1986).
18. Y. Pochet and L. A. Wolsey, Lot-sizing constant batches: Formulation and valid inequalities. Math. Oper. Res. 18 (1993) 767-785.
19. D. X. Shaw and G. Cho, Limited column generation for local access telecommunication network expansion and its extensions, - models, algorithms, and implementation. Technical report, School of Industrial Engineering, Purdue University (1994).
20. D. X. Shaw, Reformulation and column generation for several telecommunication network design problems. Proceedings of the 2nd International Telecommunication Conference, Nashville, TN (1994).