{"created":"2023-05-15T12:20:29.012471+00:00","id":11064,"links":{},"metadata":{"_buckets":{"deposit":"c52e6b2f-5a40-447d-afee-0c6da1970d1d"},"_deposit":{"created_by":1,"id":"11064","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"11064"},"status":"published"},"_oai":{"id":"oai:kansai-u.repo.nii.ac.jp:00011064","sets":["528:1538:1587"]},"author_link":["23752","23751"],"item_9_alternative_title_20":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"A Heuristic Method for Multi-Constraint Separable Discrete Optimization"}]},"item_9_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2004-05-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicPageEnd":"693","bibliographicPageStart":"690","bibliographicVolumeNumber":"J87-A","bibliographic_titles":[{"bibliographic_title":"電子情報通信学会論文誌A"}]}]},"item_9_description_4":{"attribute_name":"概要","attribute_value_mlt":[{"subitem_description":"代理双対ギャップをもつ大規模な多制約分離形離散最適化問題 （多次元非線形ナップザック問題）を厳密かつ効率良く解く改良代理制約法（ISC法）が提案された．本論文ではISC法を近似解法として利用する．その有効性を示すためにChuとBeasleyのテスト問題を用いて計算機実験を行う．難しい問題として知られている5制約条件で500変数の0-1ナップザック問題30問を解いた結果は，平均13.6秒の計算時間の場合正答率は80％，平均計算時間55.8秒の場合正答率は更に向上し100％となったことを報告する．","subitem_description_type":"Other"}]},"item_9_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"23752","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Nakagawa, Yuji"}]}]},"item_9_publisher_34":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"電子情報通信学会"}]},"item_9_rights_13":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"(C)電子情報通信学会：The original data is available at:https://search.ieice.org/"}]},"item_9_source_id_8":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"09135693","subitem_source_identifier_type":"ISSN"}]},"item_9_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":[{},{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-05-22"}],"displaytype":"detail","filename":"KU-1100-20040501-30.pdf","filesize":[{"value":"100.0 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"KU-1100-20040501-30.pdf","url":"https://kansai-u.repo.nii.ac.jp/record/11064/files/KU-1100-20040501-30.pdf"},"version_id":"f7b29786-54bb-4931-8517-02b008d01cde"}]},"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"},{"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":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"多制約分離形離散最適化問題のための近似解法","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"多制約分離形離散最適化問題のための近似解法"}]},"item_type_id":"9","owner":"1","path":["1587"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-11-19"},"publish_date":"2012-11-19","publish_status":"0","recid":"11064","relation_version_is_last":true,"title":["多制約分離形離散最適化問題のための近似解法"],"weko_creator_id":"1","weko_shared_id":1},"updated":"2023-05-15T15:40:02.570322+00:00"}