REFERENCES
- BALAS , E.M. and E. ZEMEL , “ An Algorithm for Large Zero-One Knapsack Problems ,” Operation Research , Vol. 28 , pp. 1130 – 1154 , 1980 .
- BJORNDAL , M.H. , et al. “ Some Thoughts on Combinatorial Optimisation ,1 European Journal of Operational Research , Vol. 83 , pp. 253 – 270 , 1995 .
- DUDZINSKI , K. , and S. WALUKIEWICZ , “ Exact Methods for the Knapsack Problem and Its Generalization ,” European Journal of Operational Research , Vol. 28 , pp. 3 – 12 , 1987 .
- GEIST , D. , and E. Y. RODIN , “ Adjacency of the 0-1 Knapsack Problem ,” Computers and Operation Research , Vol. 19 , no. 8 , pp. 797 – 800 , 1992 .
- INGARGIOLA , G.P. , and J.F. KORSH , “ Reduction Algorithm for Zero-One Single Knapsack Problems ,” Management Sciences , Vol. 20 , no. 4 , pp. 460 – 463 , 1973 .
- MARTELLO , S. , and P. TOTH , Knapsack Problem Algorithms and Computer Implementations , Wiley , Chichester , U.K. , 1990 .
- MURPHY , R.A. , “ Some Computational Results on 0-1 Knapsack Problems ,” Operations Research Letters , Vol. 5 , no. 2 , pp. 67 – 71 , 1986 .
- NAUSS , R.M. , “ An Efficient Algorithm for the 0-1 Knapsack Problem ,” Management Sciences , Vol. 23 , no. 1 , pp. 27 – 31 , 1976 .
- NEMHAUSER , G.L. , and L.A. WOLSEY , Integer and Combinatorial Optimization , John Wiley & Sons Publishing Company , 1988 .
- YANG , C. , “ Link Enhancement Using Constrained Range and Reduced Candidate Set Searches ,” Computer Communications , Vol. 15 , no. 9 , pp. 573 – 580 , 1992 .
- YANG , C. , and R.Y. LIN , “ Budget Management of Network Capacity Planning by Searching Constrained Range and Dominant Set ,” IEEE Journal on Selected Areas in Communications , Vol. 12 , no. 6 , pp. 1031 – 1038 , 1994 .