How to solve the collapsing subset-sum problem revisited

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.

MoreLess

Year of publication:	2011-01
Authors:	Iida, Hiroshi
Institutions:	Department of Economics, Otaru University of Commerce
Subject:	Collapsing knapsack problem \| Branch-and-bound \| Depth-first search \| Strongly correlated knapsack problem \| Subset-sum problem

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	ビジネス創造センターディスカッション・ペーパー (Discussion papers of the Center for Business Creation).
Type of publication:	Book / Working Paper
Notes:	Published in Discussion paper series (2011), 128: 1-8 8 pages
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010604768