Author:
Manicassamy Jayanthi,Karunanidhi Dinesh,Pothula Sujatha,Thirumal Vengattaraman,Ponnurangam Dhavachelvan,Ramalingam Subramanian
Publisher
Springer Science and Business Media LLC
Subject
General Computer Science,Theoretical Computer Science
Reference42 articles.
1. Azad M A K, Rocha A M A C, Fernandes E M G P. Improved binary artificial fish swarm algorithm for the 0–1 multidimensional knapsack problems. Swarm and Evolutionary Computation, 2014, 14: 66–75
2. Petersen C C. Computational experience with variants of the Balas algorithm applied to the selection of R&D projects. Management Science, 1967, 13(9): 736–750
3. Weingartner H M. Mathematical programming and the analysis of capital budgeting problems. Englewoods Cliffs, NJ: Prentice-Hall, 1963.
4. Gavish B, Pirkul H. Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality. Mathematical programming, 1985, 31(1): 78–105
5. Shih W. A branch and bound method for the multiconstraint zero-one knapsack problem. Journal of the Operational Research Society, 1979: 369–378
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献