{"created":"2025-01-19T00:53:30.695746+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00186566","sets":["1164:2592:9368:9433"]},"path":["9433"],"owner":"11","recid":"186566","title":["Limited Discrepancy Searchによるフィードバック辺集合の探索"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-03-01"},"_buckets":{"deposit":"b0ba4cef-27be-4db1-9999-17304e0f7ce6"},"_deposit":{"id":"186566","pid":{"type":"depid","value":"186566","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Limited Discrepancy Searchによるフィードバック辺集合の探索","author_link":["418913","418918","418914","418916","418915","418917"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Limited Discrepancy Searchによるフィードバック辺集合の探索"}]},"item_type_id":"4","publish_date":"2018-03-01","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"神戸大学大学院工学研究科"},{"subitem_text_value":"神戸大学大学院工学研究科"},{"subitem_text_value":"神戸大学大学院工学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Engineering, Kobe University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering, Kobe University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering, Kobe University","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/186566/files/IPSJ-AL18167010.pdf","label":"IPSJ-AL18167010.pdf"},"date":[{"dateType":"Available","dateValue":"2020-03-01"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL18167010.pdf","filesize":[{"value":"311.4 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":"369ce00e-2b1c-4588-b267-4eceb521ed77","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":[{}]},{"creatorNames":[{"creatorName":"増田, 澄男"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Itsuki, Kanemoto","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kazuaki, Yamaguchi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Sumio, Masuda","creatorNameLang":"en"}],"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":"フィードバック辺集合問題や，その一般化である線形順序付け問題は古くから研究が行われている問題である．本稿では，分枝限定法に基づいて，有望な解を含むと思われる解空間を優先的に探索する Limited Discrepancy Search (LDS) という探索法を用いてフィードバック辺集合問題の解を探索するアルゴリズムを示し，その際のいくつかの工夫について述べる．また，計算機実験により，LDS を用いたときの振る舞いを，整数計画問題として定式化してソルバー （CPLEX） で解いた場合と比較する．頂点数 30，50，100，辺密度 0.1，0.5，1.0 のランダムグラフの入力計 45 通りに対して計算機実験を行い，半数以上の （特に頂点や辺の多い） 入力に対して，LDS が CPLEX より高速に良い解や最適解に到達することを示した．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2018-03-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"10","bibliographicVolumeNumber":"2018-AL-167"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":186566,"updated":"2025-01-20T02:32:54.245319+00:00","links":{}}