@techreport{oai:barrel.repo.nii.ac.jp:00003618,
 author = {Iida, Hiroshi},
 month = {Jan},
 note = {This is a revised version of Iida [5]: We introduce a new type of problem that we shall call collapsing subset-sum problem, and present an algorithm to solve the problem. The problem is a special case of the collapsing knapsack problem, and the algorithm based on a depth-first branch-and-bound strategy, involving some tip, makes it easy to solve the problem.},
 title = {How to solve the collapsing subset-sum problem revisited},
 year = {2011}
}