{"created":"2025-01-19T01:35:12.299638+00:00","updated":"2025-01-19T10:01:27.529536+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00233683","sets":["1164:10193:11470:11538"]},"path":["11538"],"owner":"44499","recid":"233683","title":["ナップサック問題に対する拡張イジングマシンの求解性能"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-03-21"},"_buckets":{"deposit":"406678b0-5ce0-45db-84bc-0289dc44acaa"},"_deposit":{"id":"233683","pid":{"type":"depid","value":"233683","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"ナップサック問題に対する拡張イジングマシンの求解性能","author_link":["635294","635296","635295","635298","635299","635297","635300"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ナップサック問題に対する拡張イジングマシンの求解性能"}]},"item_type_id":"4","publish_date":"2024-03-21","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"お茶の水女子大学"},{"subitem_text_value":"お茶の水女子大学"},{"subitem_text_value":"富士通"},{"subitem_text_value":"富士通"},{"subitem_text_value":"富士通"},{"subitem_text_value":"DXR Lab."},{"subitem_text_value":"お茶の水女子大学／東北大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"DXR Lab.","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/233683/files/IPSJ-QS24011009.pdf","label":"IPSJ-QS24011009.pdf"},"date":[{"dateType":"Available","dateValue":"2026-03-21"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-QS24011009.pdf","filesize":[{"value":"1.0 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"53"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"55e197f7-8219-4ab7-9a15-b7ca1d025ea5","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"秋島, 遥"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"藤元, 彩花"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"印, 芳"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"古江, 友樹"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"渡部, 康弘"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"田村, 泰孝"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"工藤, 和恵"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12894105","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2435-6492","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"近年，組合せ最適化問題を解くことに特化した計算システムである，イジングマシンが注目を集めている．組合せ最適化問題は，コスト関数と制約で構成され，イジングマシンで解くには問題を二値の二次多項式，例えば Quadratic Unconstrained Binary Optimization（QUBO）で表現する必要がある．制約に不等式制約が含まれる場合，スラック変数を導入して不等式を等式に変換することで QUBO 定式化ができるが，追加の二値変数が必要になる．イジングマシンで扱う二値変数が増えると，良い解を得ることが困難になる．そこで，不等式制約を従属変数で表現する拡張イジングマシンが提唱された．不等式制約を，二値変数の増加なくそのまま扱うことができるため，QUBO 定式化と求解性能に差が出ることが予想される．本稿では，ナップサック問題と，多次元ナップサック問題を QUBO 定式化と拡張イジングマシンでの定式化でそれぞれ解き，求解にかかるイテレーション数を比較した．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告量子ソフトウェア（QS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-03-21","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicVolumeNumber":"2024-QS-11"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":233683,"links":{}}