WEKO3
アイテム
{"_buckets": {"deposit": "be2433a4-c980-41f2-8051-7b3e66275a13"}, "_deposit": {"id": "27430", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "27430"}, "status": "published"}, "_oai": {"id": "oai:tsukuba.repo.nii.ac.jp:00027430", "sets": ["311", "1871"]}, "item_5_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2012-06", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "2", "bibliographicPageEnd": "370", "bibliographicPageStart": "349", "bibliographicVolumeNumber": "13", "bibliographic_titles": [{"bibliographic_title": "Optimization and engineering"}]}]}, "item_5_creator_3": {"attribute_name": "著者別名", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "山本, 芳嗣"}], "nameIdentifiers": [{"nameIdentifier": "94746", "nameIdentifierScheme": "WEKO"}]}]}, "item_5_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "We present a rating method that, given information on the pairwise comparisons of n items, minimizes the number of inconsistencies in the ranking of those items. Our Minimum Violations Ranking (MVR) Method uses a binary linear integer program (BILP) to do this. We prove conditions when the relaxed LP will give an optimal solution to the original BILP. In addition, the LP solution gives information about ties and sensitivities in the ranking. Lastly, our MVR method makes use of bounding and constraint relaxation techniques to produce a fast algorithm for the linear ordering problem, solving an instance with about one thousand items in less than 10 minutes.", "subitem_description_type": "Abstract"}]}, "item_5_identifier_34": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2241/117291"}]}, "item_5_publisher_27": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Springer Science+Business Media, LLC"}]}, "item_5_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "10.1007/s11081-011-9135-5", "subitem_relation_type_select": "DOI"}}]}, "item_5_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "© Springer Science+Business Media, LLC 2011 \n The final publication is available at www.springerlink.com"}]}, "item_5_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "author"}]}, "item_5_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "1389-4420", "subitem_source_identifier_type": "ISSN"}]}, "item_5_source_id_9": {"attribute_name": "書誌レコードID", "attribute_value_mlt": [{"subitem_source_identifier": "AA11484866", "subitem_source_identifier_type": "NCID"}]}, "item_5_subject_20": {"attribute_name": "NIIサブジェクト", "attribute_value_mlt": [{"subitem_subject": "情報学", "subitem_subject_scheme": "Other"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Pedings, Kathryn E."}], "nameIdentifiers": [{"nameIdentifier": "94743", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Langville, Amy N."}], "nameIdentifiers": [{"nameIdentifier": "94744", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Yamamoto, Yoshitsugu"}], "nameIdentifiers": [{"nameIdentifier": "94745", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2013-12-25"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "O\u0026E_13-2.pdf", "filesize": [{"value": "795.6 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 795600.0, "url": {"label": "O\u0026E_13-2.pdf", "url": "https://tsukuba.repo.nii.ac.jp/record/27430/files/O\u0026E_13-2.pdf"}, "version_id": "e7f96a92-3645-493b-b4fd-4a6a5d555601"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "A minimum violations ranking method", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "A minimum violations ranking method"}]}, "item_type_id": "5", "owner": "1", "path": ["311", "1871"], "permalink_uri": "http://hdl.handle.net/2241/117291", "pubdate": {"attribute_name": "公開日", "attribute_value": "2012-06-14"}, "publish_date": "2012-06-14", "publish_status": "0", "recid": "27430", "relation": {}, "relation_version_is_last": true, "title": ["A minimum violations ranking method"], "weko_shared_id": null}
A minimum violations ranking method
http://hdl.handle.net/2241/117291
http://hdl.handle.net/2241/117291958fed42-ac2a-4015-9a00-f8801ef7430e
名前 / ファイル | ライセンス | アクション |
---|---|---|
O&E_13-2.pdf (795.6 kB)
|
|
Item type | Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2012-06-14 | |||||
タイトル | ||||||
タイトル | A minimum violations ranking method | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源 | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
著者 |
Pedings, Kathryn E.
× Pedings, Kathryn E.× Langville, Amy N.× Yamamoto, Yoshitsugu |
|||||
著者別名 |
山本, 芳嗣
× 山本, 芳嗣 |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | We present a rating method that, given information on the pairwise comparisons of n items, minimizes the number of inconsistencies in the ranking of those items. Our Minimum Violations Ranking (MVR) Method uses a binary linear integer program (BILP) to do this. We prove conditions when the relaxed LP will give an optimal solution to the original BILP. In addition, the LP solution gives information about ties and sensitivities in the ranking. Lastly, our MVR method makes use of bounding and constraint relaxation techniques to produce a fast algorithm for the linear ordering problem, solving an instance with about one thousand items in less than 10 minutes. | |||||
書誌情報 |
Optimization and engineering 巻 13, 号 2, p. 349-370, 発行日 2012-06 |
|||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 1389-4420 | |||||
書誌レコードID | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AA11484866 | |||||
DOI | ||||||
識別子タイプ | DOI | |||||
関連識別子 | 10.1007/s11081-011-9135-5 | |||||
権利 | ||||||
権利情報 | © Springer Science+Business Media, LLC 2011 The final publication is available at www.springerlink.com |
|||||
著者版フラグ | ||||||
値 | author | |||||
出版者 | ||||||
出版者 | Springer Science+Business Media, LLC | |||||
URI | ||||||
識別子 | http://hdl.handle.net/2241/117291 | |||||
識別子タイプ | HDL |