subset sum - finding the maximum sum strict lower than m with subset size k

subset sum - finding the maximum sum strict lower than m with subset size k

References

Reference NO 1

http://stackoverflow.com/questions/15165883/subset-sum-finding-the-maximum-sum-strict-lower-than-m-with-subset-size-k

Reference NO 2

http://stackoverflow.com/questions/11647832/subset-of-values-with-length-n-and-sum-s

Reference NO 3

http://www.quora.com/Algorithms/Find-the-maximum-sum-of-k-length-subset-of-a-given-set-such-that-sum-is-strictly-less-than-M

Reference NO 4

http://www.sciencedirect.com/science/article/pii/S089812219800162X

Reference NO 5

http://code-em-up.blogspot.com/2012/07/question-given-unsorted-array-of.html

Reference NO 6

http://cs.stackexchange.com/questions/8988/complexity-of-a-subset-sum-variant

Reference NO 7

http://59.77.16.8/DownLoad/%E7%AE%97%E6%B3%95%E8%AE%BE%E8%AE%A1%E4%B8%8E%E5%88%86%E6%9E%90%EF%BC%88%E9%AB%98%E7%BA%A7%E6%95%99%E7%A8%8B%EF%BC%89/3.6%20The%20knapsack%20problem.ppt

Reference NO 8

http://micsymposium.org/mics_2013_Proceedings/submissions/mics20130_submission_13.pdf