WEKO3
アイテム
{"_buckets": {"deposit": "3e615798-86ea-42b3-865b-7f7c61b0d77c"}, "_deposit": {"created_by": 3, "id": "3618", "owners": [3], "pid": {"revision_id": 0, "type": "depid", "value": "3618"}, "status": "published"}, "_oai": {"id": "oai:barrel.repo.nii.ac.jp:00003618", "sets": ["15"]}, "author_link": ["7688"], "item_8_biblio_info_4": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2011-01", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "8", "bibliographicPageStart": "1", "bibliographicVolumeNumber": "128", "bibliographic_titles": [{"bibliographic_title": "Discussion paper series"}]}]}, "item_8_description_20": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "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.", "subitem_description_type": "Abstract"}]}, "item_8_publisher_5": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "小樽商科大学ビジネス創造センター"}]}, "item_8_subject_18": {"attribute_name": "日本十進分類法", "attribute_value_mlt": [{"subitem_subject": "410", "subitem_subject_scheme": "NDC"}]}, "item_8_subject_19": {"attribute_name": "NIIサブジェクト", "attribute_value_mlt": [{"subitem_subject": "数学", "subitem_subject_scheme": "Other"}]}, "item_8_version_type_17": {"attribute_name": "テキストバージョン", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Iida, Hiroshi"}], "nameIdentifiers": [{"nameIdentifier": "7688", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2016-01-26"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "DP_128.pdf", "filesize": [{"value": "385.1 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 385100.0, "url": {"label": "DP_128.pdf", "url": "https://barrel.repo.nii.ac.jp/record/3618/files/DP_128.pdf"}, "version_id": "5f51c8d5-cd83-4e2a-8d39-97af84b51357"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "Collapsing knapsack problem", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Branch-and-bound", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Depth-first search", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Strongly correlated knapsack problem", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Subset-sum problem", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "technical report", "resourceuri": "http://purl.org/coar/resource_type/c_18gh"}]}, "item_title": "How to solve the collapsing subset-sum problem revisited", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "How to solve the collapsing subset-sum problem revisited"}]}, "item_type_id": "8", "owner": "3", "path": ["15", "145"], "permalink_uri": "http://hdl.handle.net/10252/4432", "pubdate": {"attribute_name": "公開日", "attribute_value": "2011-02-01"}, "publish_date": "2011-02-01", "publish_status": "0", "recid": "3618", "relation": {}, "relation_version_is_last": true, "title": ["How to solve the collapsing subset-sum problem revisited"], "weko_shared_id": 3}
How to solve the collapsing subset-sum problem revisited
http://hdl.handle.net/10252/4432
http://hdl.handle.net/10252/443217cf9a6f-3e2b-43a2-980b-1e4a9a5d0a92
名前 / ファイル | ライセンス | アクション |
---|---|---|
DP_128.pdf (385.1 kB)
|
|
Item type | テクニカルレポート / Technical Report(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2011-02-01 | |||||
タイトル | ||||||
タイトル | How to solve the collapsing subset-sum problem revisited | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Collapsing knapsack problem | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Branch-and-bound | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Depth-first search | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Strongly correlated knapsack problem | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Subset-sum problem | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_18gh | |||||
資源タイプ | technical report | |||||
著者 |
Iida, Hiroshi
× Iida, Hiroshi |
|||||
書誌情報 |
Discussion paper series 巻 128, p. 1-8, 発行日 2011-01 |
|||||
出版者 | ||||||
出版者 | 小樽商科大学ビジネス創造センター | |||||
テキストバージョン | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
日本十進分類法 | ||||||
主題Scheme | NDC | |||||
主題 | 410 | |||||
NIIサブジェクト | ||||||
主題Scheme | Other | |||||
主題 | 数学 | |||||
抄録 | ||||||
内容記述タイプ | 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. |