{"created":"2023-05-15T15:31:05.578012+00:00","id":3664,"links":{},"metadata":{"_buckets":{"deposit":"b544301c-56f3-48be-8b2a-22575f147f3d"},"_deposit":{"created_by":3,"id":"3664","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"3664"},"status":"published"},"_oai":{"id":"oai:barrel.repo.nii.ac.jp:00003664","sets":["1:15"]},"author_link":["7798","7799"],"item_8_biblio_info_4":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2005-07","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"7","bibliographicPageStart":"1","bibliographicVolumeNumber":"101","bibliographic_titles":[{"bibliographic_title":"Discussion paper series"}]}]},"item_8_description_20":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"整数ナップサック問題は, よく知られた0?1 ナップサック問題の数ある拡張の一つである.0?1 ナップサック問題の拡張ゆえに, 整数ナップサック問題も容易には解けない問題であり, 分枝限定法・動的計画法等の一般的な枠組みを用いて解かざるを得ない. しかしその一方で, ある特殊な場合には多項式時間で解けるということも知られている. 本稿では, この特殊な場合に焦点を当て, これまでに行われた研究を概観するとともに, いくつかの話題を提供する.","subitem_description_type":"Abstract"}]},"item_8_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"7799","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Iida, Hiroshi"}]}]},"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":"飯田, 浩志"}],"nameIdentifiers":[{"nameIdentifier":"7798","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2016-01-26"}],"displaytype":"detail","filename":"no101.pdf","filesize":[{"value":"253.4 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"no101.pdf","url":"https://barrel.repo.nii.ac.jp/record/3664/files/no101.pdf"},"version_id":"1b637b28-3f0d-4d33-afee-7f1764e5ae25"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"組合せ最適化","subitem_subject_scheme":"Other"},{"subitem_subject":"ナップサック問題","subitem_subject_scheme":"Other"},{"subitem_subject":"貪欲法","subitem_subject_scheme":"Other"},{"subitem_subject":"多項式アルゴリズム","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"technical report","resourceuri":"http://purl.org/coar/resource_type/c_18gh"}]},"item_title":"整数ナップサック問題が多項式時間で解ける特殊な場合を定める条件について","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"整数ナップサック問題が多項式時間で解ける特殊な場合を定める条件について"}]},"item_type_id":"8","owner":"3","path":["15","145"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-06-17"},"publish_date":"2008-06-17","publish_status":"0","recid":"3664","relation_version_is_last":true,"title":["整数ナップサック問題が多項式時間で解ける特殊な場合を定める条件について"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-07-20T08:28:28.111660+00:00"}