{"created":"2025-01-19T01:28:56.241581+00:00","updated":"2025-01-19T11:28:24.887206+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00229653","sets":["6504:11436:11438"]},"path":["11438"],"owner":"44499","recid":"229653","title":["魔女の最適調合問題–非減少部分列の最適化に基づく多次元ソーティング問題"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-02-16"},"_buckets":{"deposit":"d439cbec-2117-4a30-861e-bb1137a3c81a"},"_deposit":{"id":"229653","pid":{"type":"depid","value":"229653","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"魔女の最適調合問題–非減少部分列の最適化に基づく多次元ソーティング問題","author_link":["617739","617740"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"魔女の最適調合問題–非減少部分列の最適化に基づく多次元ソーティング問題"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウェア科学・工学","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2023-02-16","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"関西学院大"},{"subitem_text_value":"関西学院大"}]},"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/229653/files/IPSJ-Z85-1L-06.pdf","label":"IPSJ-Z85-1L-06.pdf"},"date":[{"dateType":"Available","dateValue":"2023-11-17"}],"format":"application/pdf","filename":"IPSJ-Z85-1L-06.pdf","filesize":[{"value":"348.9 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"e3e5bda7-6f8b-4755-9d3d-30e058fd6e36","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"藤原, 直紀"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"徳山, 豪"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"d 次元の n 個のベクトル列が与えられたとき,列ベクトルを並べ替えて d × n の行列として考える.行列の様子は列ベクトルの順序によるが,これを目的関数を最大/最小にするような列ベクトルの順列を見つける問題として定式化する.目的関数は,行列の各行に対するファーストフィット非減少部分列の要素の効用の和で定義することで,最大化問題をソーティング問題の自然な一般化として考えることができる.本論文では,d が定数の場合には,多項式時間アルゴリズムが構成できることを示し,d が一般である場合に対しては,集合被覆問題や劣モジュラ最適化との関係を調査し,計算複雑度を考察する.","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"248","bibliographic_titles":[{"bibliographic_title":"第85回全国大会講演論文集"}],"bibliographicPageStart":"247","bibliographicIssueDates":{"bibliographicIssueDate":"2023-02-16","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2023"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":229653,"links":{}}