{"created":"2023-05-15T15:31:04.738152+00:00","id":3645,"links":{},"metadata":{"_buckets":{"deposit":"a6a11177-db19-45fc-8ad0-da7dc530f6b0"},"_deposit":{"created_by":17,"id":"3645","owners":[17],"pid":{"revision_id":0,"type":"depid","value":"3645"},"status":"published"},"_oai":{"id":"oai:barrel.repo.nii.ac.jp:00003645","sets":["1:15","145"]},"author_link":["7752"],"item_8_biblio_info_4":{"attribute_name":"bibliographic_information","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2007-03","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"5","bibliographicPageStart":"1","bibliographicVolumeNumber":"110","bibliographic_titles":[{"bibliographic_title":"Discussion paper series","bibliographic_titleLang":"en"}]}]},"item_8_description_20":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"The classical binary knapsack problem has numerous generalisations in relation to not only a capacity constraint but also an objective function. In 2006, two knapsack problems have coincidentally been proposed, both of which have an extension of the objective function paying the penalty. This article gives some comments on the two problems.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_8_publisher_5":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"小樽商科大学ビジネス創造センター","subitem_publisher_language":"ja"}]},"item_8_subject_18":{"attribute_name":"日本十進分類法","attribute_value_mlt":[{"subitem_subject":"410","subitem_subject_language":"ja","subitem_subject_scheme":"NDC"}]},"item_8_subject_19":{"attribute_name":"NIIサブジェクト","attribute_value_mlt":[{"subitem_subject":"数学","subitem_subject_language":"ja","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","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"7752","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":"no110.pdf","filesize":[{"value":"102.9 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"no110.pdf","url":"https://barrel.repo.nii.ac.jp/record/3645/files/no110.pdf"},"version_id":"198e567a-684f-4952-a467-c937f6aef869"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Combinatorial Optimisation","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Knapsack Problem","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Penalty","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"item_resource_type","attribute_value_mlt":[{"resourcetype":"technical report","resourceuri":"http://purl.org/coar/resource_type/c_18gh"}]},"item_title":"Comments on knapsack problems with a penalty","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Comments on knapsack problems with a penalty","subitem_title_language":"en"}]},"item_type_id":"8","owner":"17","path":["145","15"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2008-06-17"},"publish_date":"2008-06-17","publish_status":"0","recid":"3645","relation_version_is_last":true,"title":["Comments on knapsack problems with a penalty"],"weko_creator_id":"17","weko_shared_id":-1},"updated":"2025-02-17T07:18:13.216716+00:00"}