{"links":{},"id":189226,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00189226","sets":["1164:2592:9368:9483"]},"path":["9483"],"owner":"11","recid":"189226","title":["L1距離制約をもつ分離凸資源配分問題に対するアルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-05-18"},"_buckets":{"deposit":"85050af2-e603-4af2-b75e-0d74be985fd9"},"_deposit":{"id":"189226","pid":{"type":"depid","value":"189226","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"L1距離制約をもつ分離凸資源配分問題に対するアルゴリズム","author_link":["430024","430025"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"L1距離制約をもつ分離凸資源配分問題に対するアルゴリズム"}]},"item_type_id":"4","publish_date":"2018-05-18","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京工業大学工学院経営工学系"},{"subitem_text_value":"東京工業大学工学院経営工学系"}]},"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/189226/files/IPSJ-AL18168005.pdf","label":"IPSJ-AL18168005.pdf"},"date":[{"dateType":"Available","dateValue":"2020-05-18"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL18168005.pdf","filesize":[{"value":"272.3 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"5374092a-aae6-45d3-ae78-222ba0507f5a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2018 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":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","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":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"分離凸資源配分問題とは，複数の活動に対して有限個の離散的な資源を割り当てる問題であり，凸関数で表される経費 ・ 損失が最小になるように割り当てることを目的とする．本稿では，所与のベクトルから解ベクトルへの L1 距離が定数以下，という制約の下での分離凸資源配分問題を考え，厳密解を求めるアルゴリズムを提案する．まず，L1 距離制約の下での最も単純な分離凸資源配分問題がポリマトロイド制約付き資源配分問題の特殊ケースと見なせることを示す．この結果に基づき，最適解が多項式時間で求められることを示す．さらに，より一般的な資源配分問題に L1 距離制約を加えた場合，ポリマトロイド制約付き資源配分問題の枠組みに当てはまらない事を具体例により示す．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2018-05-18","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"2018-AL-168"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-19T00:55:18.380874+00:00","updated":"2025-01-20T01:41:54.141952+00:00"}