{"created":"2023-05-15T15:28:03.824159+00:00","id":47,"links":{},"metadata":{"_buckets":{"deposit":"3c3f4dcb-b95d-49f8-8325-96805ad31185"},"_deposit":{"created_by":17,"id":"47","owners":[17],"pid":{"revision_id":0,"type":"depid","value":"47"},"status":"published"},"_oai":{"id":"oai:barrel.repo.nii.ac.jp:00000047","sets":["1:15","4"]},"author_link":["828","274"],"item_1_biblio_info_5":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1999-07","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"94","bibliographicPageStart":"89","bibliographicVolumeNumber":"3","bibliographic_titles":[{"bibliographic_title":"Journal of Combinatorial Optimization","bibliographic_titleLang":"en"}]}]},"item_1_description_18":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"In this paper we propose new lower and upper bounds for the max-min 0-1 knapsack problem, employing a mixture of two relaxations. In addition, in order to expose whether the bounds are practical or not, we implement a method incorporating the bounds to achieve an optimal solution of the problem.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_1_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"828","nameIdentifierScheme":"WEKO"}],"names":[{"name":"飯田, 浩志","nameLang":"ja"}]}]},"item_1_publisher_6":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Kluwer Academic Publishers","subitem_publisher_language":"en"}]},"item_1_relation_8":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type":"isVersionOf","subitem_relation_type_id":{"subitem_relation_type_id_text":"info:doi/10.1023/A:1009821323279","subitem_relation_type_select":"DOI"}}]},"item_1_rights_12":{"attribute_name":"権利表記","attribute_value_mlt":[{"subitem_rights":"The original publication is available at www.springerlink.com","subitem_rights_language":"en"}]},"item_1_rights_13":{"attribute_name":"出版社版URI","attribute_value_mlt":[{"subitem_rights":"http://www.springerlink.com/content/1382-6905/","subitem_rights_language":"ja"}]},"item_1_source_id_11":{"attribute_name":"書誌ID（NCID）","attribute_value_mlt":[{"subitem_source_identifier":"AA11120156","subitem_source_identifier_type":"NCID"}]},"item_1_source_id_7":{"attribute_name":"ISSN / EISSN","attribute_value_mlt":[{"subitem_source_identifier":"1382-6905","subitem_source_identifier_type":"PISSN"}]},"item_1_subject_16":{"attribute_name":"日本十進分類法","attribute_value_mlt":[{"subitem_subject":"410.8","subitem_subject_language":"ja","subitem_subject_scheme":"NDC"}]},"item_1_subject_17":{"attribute_name":"NIIサブジェクト","attribute_value_mlt":[{"subitem_subject":"数学","subitem_subject_language":"ja","subitem_subject_scheme":"Other"}]},"item_1_version_type_15":{"attribute_name":"テキストバージョン","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_ab4af688f83e57aa","subitem_version_type":"AM"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Iida, Hiroshi","creatorNameLang":"en","creatorNameType":"Personal"}],"nameIdentifiers":[{"nameIdentifier":"274","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2016-01-22"}],"displaytype":"detail","filename":"kbstmpl.PDF","filesize":[{"value":"168.1 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"kbstmpl.PDF","url":"https://barrel.repo.nii.ac.jp/record/47/files/kbstmpl.PDF"},"version_id":"df94e366-775f-45ae-970e-f8437a76216d"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"knapsack problem","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"surrogate relaxation","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"linear programming relaxation","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"branch-and-bound","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"A note on the max-min 0-1 knapsack problem","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A note on the max-min 0-1 knapsack problem","subitem_title_language":"en"}]},"item_type_id":"1","owner":"17","path":["4","15"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2007-11-26"},"publish_date":"2007-11-26","publish_status":"0","recid":"47","relation_version_is_last":true,"title":["A note on the max-min 0-1 knapsack problem"],"weko_creator_id":"17","weko_shared_id":-1},"updated":"2025-02-17T07:35:44.575156+00:00"}