{"created":"2023-07-25T10:35:26.831071+00:00","id":10311,"links":{},"metadata":{"_buckets":{"deposit":"3ddca444-e61c-4ab9-b60d-6798b075d1f8"},"_deposit":{"created_by":10,"id":"10311","owners":[10],"pid":{"revision_id":0,"type":"depid","value":"10311"},"status":"published"},"_oai":{"id":"oai:senshu-u.repo.nii.ac.jp:00010311","sets":["24:1189"]},"author_link":["601"],"item_11_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2015-07-31","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"16","bibliographicPageStart":"1","bibliographicVolumeNumber":"36","bibliographic_titles":[{"bibliographic_title":"日本経営数学会誌"}]}]},"item_11_creator_2":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"高萩, 栄一郎"}],"nameIdentifiers":[{},{},{}]}]},"item_11_relation_10":{"attribute_name":"関連URL","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"作成したシステム"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://cgi.isc.senshu-u.ac.jp/~thc0456/AHPnewPC/","subitem_relation_type_select":"URI"}}]},"item_11_title_1":{"attribute_name":"別言語のタイトル(英)","attribute_value_mlt":[{"subitem_title":"Algorithms for Eliminating Loops on Pairwise Comparisons and Satisfying Loose Consistency Constraints"}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-12-04"}],"displaytype":"detail","filename":"JSBM-Vol36-1.pdf","filesize":[{"value":"378.8 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"JSBM-Vol36-1","url":"https://senshu-u.repo.nii.ac.jp/record/10311/files/JSBM-Vol36-1.pdf"},"version_id":"f5f0c672-a9db-4f4c-84c1-51aa2de04071"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"AHP","subitem_subject_scheme":"Other"},{"subitem_subject":"一対比較","subitem_subject_scheme":"Other"},{"subitem_subject":"推移性","subitem_subject_scheme":"Other"},{"subitem_subject":"緩和な整合性制約","subitem_subject_scheme":"Other"},{"subitem_subject":"全順序","subitem_subject_scheme":"Other"},{"subitem_subject":"Analytic Hierarchy Process","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Pairwise Comparison","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Transitive Law","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Loose Consistency Constraint","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Total Order","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_title":"一対比較におけるループの解消と緩和な整合性制約を満たすためのアルゴリズム","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"一対比較におけるループの解消と緩和な整合性制約を満たすためのアルゴリズム"}]},"item_type_id":"11","owner":"10","path":["1189"],"publish_date":"2019-12-04","publish_status":"0","recid":"10311","relation_version_is_last":true,"title":["一対比較におけるループの解消と緩和な整合性制約を満たすためのアルゴリズム"],"weko_creator_id":"10","weko_shared_id":-1},"updated":"2023-09-13T02:55:00.016191+00:00"}