{"updated":"2025-01-22T23:27:36.135230+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00017223","sets":["934:989:1002:1005"]},"path":["1005"],"owner":"1","recid":"17223","title":["最長しりとり問題の解法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2005-01-15"},"_buckets":{"deposit":"f02c14c5-2bee-44ef-8c98-f7951c781f97"},"_deposit":{"id":"17223","pid":{"type":"depid","value":"17223","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"最長しりとり問題の解法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"最長しりとり問題の解法"},{"subitem_title":"Solving the Longest Shiritori Problem","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"事例紹介論文","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2005-01-15","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京農工大学大学院共生科学技術研究部"},{"subitem_text_value":"東京農工大学大学院共生科学技術研究部"},{"subitem_text_value":"東京農工大学工学教育部"},{"subitem_text_value":"東京農工大学大学院共生科学技術研究部"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Institute of Symbiotic Science and Technology Tokyo University of Agriculture and Technology","subitem_text_language":"en"},{"subitem_text_value":"Institute of Symbiotic Science and Technology Tokyo University of Agriculture and Technology","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineeering Tokyo University of Agriculture and Technology","subitem_text_language":"en"},{"subitem_text_value":"Institute of Symbiotic Science and Technology Tokyo University of Agriculture and Technology","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/17223/files/IPSJ-TOM4602012.pdf"},"date":[{"dateType":"Available","dateValue":"2007-01-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOM4602012.pdf","filesize":[{"value":"413.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":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"81ce5d53-ca51-46ba-b88a-4f35f215df5a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2005 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"乾, 伸雄"},{"creatorName":"品野, 勇治"},{"creatorName":"鴻池, 祐輔"},{"creatorName":"小谷, 善行"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Nobuo, Inui","creatorNameLang":"en"},{"creatorName":"Yuji, Shinano","creatorNameLang":"en"},{"creatorName":"Yuusuke, Kounoike","creatorNameLang":"en"},{"creatorName":"Yoshiyuki, Kotani","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464803","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7780","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本論文では，最長しりとり問題をネットワークの問題としてモデル化し，整数計画問題として定式化を行う．この定式化では，変数の数が頂点数に対して，指数オーダで増加するため，事実上，整数計画問題として直接的に解くことは難しい．そのため，緩和問題を設定し，LP ベースの分枝限定法によって解決した．これによって，19 万語程度の辞書から最長しりとりをXeon2.8GHz プロセッサのPC を使って1 秒程度で作成することができた．また，本論文では，局所探索による解法と比較し，問題の困難さを実験的に調べた．さらに，様々なインスタンスにおける解を分析することで，最長しりとり問題の性質を調べた．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper describes the definition of the longest Shiritori problem as a problem of network flow and the solution using the the integer problem. This formulation requires a large number of variables being of exponential order. To overcome the difficulty, we propose a solution based on the LP-based branch-and-bound method, which solves the relaxation problems repeatedly and enumerates all the solutions implicitly. This method is able to calculate the longest Shiritori sequences for 190 thousand words dictionary in a second in Xeon 2.8GHz PC. In this paper, we compare the performances for the heuristic local search and investigate the results for a variety of instances to explore characteristics of the longest Shiritori problem.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"117","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌数理モデル化と応用（TOM）"}],"bibliographicPageStart":"105","bibliographicIssueDates":{"bibliographicIssueDate":"2005-01-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"SIG2(TOM11)","bibliographicVolumeNumber":"46"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:50:16.697926+00:00","id":17223,"links":{}}