How to solve the collapsing subset-sum problem revisited

Material type: 文書・図像類

Author: Iida, Hiroshi

Publisher: 小樽商科大学ビジネス創造センター

Publication date: 2011-01

Material Format: Digital

Capacity, size, etc.: -

NDC: 410

View All

Notes on use

Note (General)：: 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 t...

Search by Bookstore

Holdings of Libraries in Japan

This page shows libraries in Japan other than the National Diet Library that hold the material.

List of Cooperating Institutions and Databases

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

Otaru University of Commerce Academic Collections
Digital
You can check the holdings of institutions and databases with which 学術機関リポジトリデータベース（IRDB）（機関リポジトリ） is linked at the site of 学術機関リポジトリデータベース（IRDB）（機関リポジトリ）.
Otaru University of Commerce Academic Collections

Search by Bookstore

Bibliographic Record

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Digital

Material Type: 文書・図像類
Title: How to solve the collapsing subset-sum problem revisited
Author/Editor: Iida, Hiroshi
Author Heading: Iida, Hiroshi
Publication, Distribution, etc.: 小樽商科大学ビジネス創造センター
Publication Date: 2011-01
Publication Date (W3CDTF): 2011-01
Periodical title: Discussion paper series
No. or year of volume/issue: 128
Volume: 128
Pages: 1-8
Text Language Code: eng
Subject Heading: Collapsing knapsack problem
Branch-and-bound
Depth-first search
Strongly correlated knapsack problem
Subset-sum problem
数学
NDC: 410
Target Audience: 一般
Note (General): 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.
Source: https://barrel.repo.nii.ac.jp/?action=repository_action_common_download&item_id=3618&item_no=1&attribute_id=21&file_no=1
https://barrel.repo.nii.ac.jp/?action=repository_action_common_download&item_id=3618&item_no=1&attribute_id=21&file_no=1
Access Restrictions: 限定公開
Data Provider (Database): 国立情報学研究所 : 学術機関リポジトリデータベース（IRDB）（機関リポジトリ）
https://irdb.nii.ac.jp
Original Data Provider (Database): 小樽商科大学 : 小樽商科大学学術成果コレクション