{"created":"2023-05-15T15:28:10.624542+00:00","id":184,"links":{},"metadata":{"_buckets":{"deposit":"c16a0711-1e80-4268-8125-13349769de72"},"_deposit":{"created_by":3,"id":"184","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"184"},"status":"published"},"_oai":{"id":"oai:barrel.repo.nii.ac.jp:00000184","sets":["1:15"]},"author_link":["546"],"item_5_biblio_info_5":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2015-07-25","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"205","bibliographicPageStart":"197","bibliographicVolumeNumber":"66","bibliographic_titles":[{"bibliographic_title":"商学討究"}]}]},"item_5_description_18":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"This piece picks up E-kKP as a knapsack problem in relation to the conventional and the simplest 2-approximation algorithm for the 0-1 knapsack problem. Taking account of the similarity between E-kKP and the multiple-choice knapsack problem, we mention how to produce two candidates onto the conventional and also how to obtain an optimal solution of LP-relaxed E-kKP that we require so as to produce the two candidates.","subitem_description_type":"Abstract"}]},"item_5_description_4":{"attribute_name":"カテゴリ","attribute_value_mlt":[{"subitem_description":"論説","subitem_description_type":"Other"}]},"item_5_publisher_6":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"小樽商科大学"}]},"item_5_source_id_11":{"attribute_name":"書誌ID（NCID）","attribute_value_mlt":[{"subitem_source_identifier":"AN00114062","subitem_source_identifier_type":"NCID"}]},"item_5_source_id_7":{"attribute_name":"ISSN / EISSN","attribute_value_mlt":[{"subitem_source_identifier":"04748638","subitem_source_identifier_type":"ISSN"}]},"item_5_subject_16":{"attribute_name":"日本十進分類法","attribute_value_mlt":[{"subitem_subject":"410","subitem_subject_scheme":"NDC"}]},"item_5_subject_17":{"attribute_name":"NIIサブジェクト","attribute_value_mlt":[{"subitem_subject":"数学","subitem_subject_scheme":"Other"}]},"item_5_version_type_15":{"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":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2016-01-22"}],"displaytype":"detail","filename":"ER_66(1)_197-205.pdf","filesize":[{"value":"257.7 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"ER_66(1)_197-205.pdf","url":"https://barrel.repo.nii.ac.jp/record/184/files/ER_66(1)_197-205.pdf"},"version_id":"57d91136-efce-4aac-bf99-48e78d280850"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"On E-kKP as a knapsack problem related to the conventional 2-approximation algorithm for the 0-1 knapsack problem","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"On E-kKP as a knapsack problem related to the conventional 2-approximation algorithm for the 0-1 knapsack problem"}]},"item_type_id":"5","owner":"3","path":["15","41"],"pubdate":{"attribute_name":"公開日","attribute_value":"2015-08-03"},"publish_date":"2015-08-03","publish_status":"0","recid":"184","relation_version_is_last":true,"title":["On E-kKP as a knapsack problem related to the conventional 2-approximation algorithm for the 0-1 knapsack problem"],"weko_creator_id":"3","weko_shared_id":3},"updated":"2023-08-08T07:46:39.943450+00:00"}