How to solve the collapsing subset-sum problem revisited

Hiroshi Iida

ビジネス創造センターディスカッション・ペーパー (Discussion papers of the Center for Business Creation) from Otaru University of Commerce

Abstract: 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.

Keywords: Collapsing knapsack problem; Branch-and-bound; Depth-first search; Strongly correlated knapsack problem; Subset-sum problem (search for similar items in EconPapers)
Pages: 8 pages
Date: 2011-01
References: View references in EconPapers View complete reference list from CitEc
Citations:

Published in Discussion paper series (2011), 128: 1-8

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ota:busdis:10252/4432

Access Statistics for this paper

More papers in ビジネス創造センターディスカッション・ペーパー (Discussion papers of the Center for Business Creation) from Otaru University of Commerce Contact information at EDIRC.
Bibliographic data for series maintained by Miura, Chiho ().