{"created":"2021-03-01T06:29:01.386003+00:00","id":21360,"links":{},"metadata":{"_buckets":{"deposit":"2325f27c-b0a1-4484-8e29-9b8fd89ec19d"},"_deposit":{"id":"21360","owners":[],"pid":{"revision_id":0,"type":"depid","value":"21360"},"status":"published"},"_oai":{"id":"oai:nagoya.repo.nii.ac.jp:00021360","sets":["312:313:314"]},"author_link":["61676","61677","61678","61679"],"item_10_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2013-05","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"50","bibliographicPageEnd":"110","bibliographicPageStart":"103","bibliographicVolumeNumber":"113","bibliographic_titles":[{"bibliographic_title":"電子情報通信学会技術研究報告. COMP, コンピュテーション","bibliographic_titleLang":"ja"}]}]},"item_10_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"3次元箱詰め問題に対する代表的な構築型解法として,deepest-bottom-left(DBL)法と3次元におけるbest-fit(3BF)法と呼ばれる2つの手法がある.本研究では,これらの構築型解法に対して,既存の手法と比べて理論計算量の少ない効率的な実現法を提案する.また,アルゴリズムの不要な探索を省略することで実計算時間を減らす工夫を加える.とくに,3BF法では,この目的を実現するために分枝限定法を活用する.このような工夫を加えた結果,大規模な問題例においても実用的な時間で解を得られることを計算実験により確認した.","subitem_description_language":"ja","subitem_description_type":"Abstract"}]},"item_10_description_5":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"情報処理学会研究報告Vol.2013-AL-144 No.16","subitem_description_language":"ja","subitem_description_type":"Other"}]},"item_10_identifier_60":{"attribute_name":"URI","attribute_value_mlt":[{"subitem_identifier_type":"URI","subitem_identifier_uri":"http://ci.nii.ac.jp/naid/110009768649/"},{"subitem_identifier_type":"HDL","subitem_identifier_uri":"http://hdl.handle.net/2237/23504"}]},"item_10_publisher_32":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"一般社団法人電子情報通信学会","subitem_publisher_language":"ja"}]},"item_10_relation_43":{"attribute_name":"関連情報","attribute_value_mlt":[{"subitem_relation_type":"isVersionOf","subitem_relation_type_id":{"subitem_relation_type_id_text":"http://ci.nii.ac.jp/naid/110009768649/","subitem_relation_type_select":"URI"}}]},"item_10_rights_12":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"(c)一般社団法人電子情報通信学会・情報処理学会 本文データは学協会の許諾に基づきCiNiiから複製したものである","subitem_rights_language":"ja"}]},"item_10_select_15":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_select_item":"publisher"}]},"item_10_source_id_7":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0913-5685","subitem_source_identifier_type":"PISSN"}]},"item_1615787544753":{"attribute_name":"出版タイプ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"田中, 勇真","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"61676","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"川島, 大貴","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"61677","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"今堀, 慎治","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"61678","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"柳浦, 睦憲","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"61679","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2018-02-21"}],"displaytype":"detail","filename":"110009768649.pdf","filesize":[{"value":"1.3 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"110009768649.pdf","objectType":"fulltext","url":"https://nagoya.repo.nii.ac.jp/record/21360/files/110009768649.pdf"},"version_id":"1e59611b-7aa6-4cec-95d4-9581fccd79b5"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"3次元箱詰め問題に対する構築型解法の効率的実現法","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"3次元箱詰め問題に対する構築型解法の効率的実現法","subitem_title_language":"ja"}]},"item_type_id":"10","owner":"1","path":["314"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2016-02-22"},"publish_date":"2016-02-22","publish_status":"0","recid":"21360","relation_version_is_last":true,"title":["3次元箱詰め問題に対する構築型解法の効率的実現法"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-01-16T04:10:34.666019+00:00"}