{"created":"2021-03-01T07:27:48.867961+00:00","id":47769,"links":{},"metadata":{"_buckets":{"deposit":"d7599075-3039-4773-9aea-8b1b1f7fc69b"},"_deposit":{"id":"47769","owners":[],"pid":{"revision_id":0,"type":"depid","value":"47769"},"status":"published"},"_oai":{"id":"oai:tsukuba.repo.nii.ac.jp:00047769","sets":["152:2148","152:2909","3:62:5597:6919"]},"item_5_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2018-07","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicPageEnd":"943","bibliographicPageStart":"933","bibliographicVolumeNumber":"12","bibliographic_titles":[{"bibliographic_title":"Optimization letters"}]}]},"item_5_creator_3":{"attribute_name":"著者別名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"久野, 誉人"}],"nameIdentifiers":[{},{},{}]},{"creatorNames":[{"creatorName":"佐野, 良夫"}],"nameIdentifiers":[{},{},{}]}]},"item_5_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"This paper addresses an upper bound derived by Kitahara and Mizuno (Math Program A 137:579–586, 2013) on the number of basic feasible solutions of a linear program generated with the simplex algorithm. Their bound includes two parameters δ and γ, which are respectively the minimum and the maximum values of positive components in all basic feasible solutions. We show that δ is NP-hard to determine while γ can be computed in polynomial time. We also report some numerical results using alternative parameters for δ and γ.","subitem_description_type":"Abstract"}]},"item_5_publisher_27":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Springer"}]},"item_5_relation_11":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"10.1007/s11590-018-1276-4","subitem_relation_type_select":"DOI"}}]},"item_5_rights_12":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"© Springer-Verlag GmbH Germany, part of Springer Nature 2018"}]},"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":"1862-4472","subitem_source_identifier_type":"ISSN"}]},"item_5_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12249544","subitem_source_identifier_type":"NCID"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kuno, Takahito"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Sano, Yoshio"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tsuruda, Takahiro"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-07-01"}],"displaytype":"detail","filename":"OL_12-5.pdf","filesize":[{"value":"75.4 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"OL_12-5","url":"https://tsukuba.repo.nii.ac.jp/record/47769/files/OL_12-5.pdf"},"version_id":"241b02be-44ad-4df8-adce-1e63b5e628a9"}]},"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":"Computing Kitahara–Mizuno’s bound on the number of basic feasible solutions generated with the simplex algorithm","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Computing Kitahara–Mizuno’s bound on the number of basic feasible solutions generated with the simplex algorithm"}]},"item_type_id":"5","owner":"1","path":["2148","2909","6919"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-09-04"},"publish_date":"2018-09-04","publish_status":"0","recid":"47769","relation_version_is_last":true,"title":["Computing Kitahara–Mizuno’s bound on the number of basic feasible solutions generated with the simplex algorithm"],"weko_creator_id":"1","weko_shared_id":5},"updated":"2022-04-27T09:19:52.809192+00:00"}