WEKO3
アイテム
{"_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": ["2148", "2909", "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": [{"nameIdentifier": "688", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "00205113", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://nrid.nii.ac.jp/ja/nrid/1000000205113"}, {"nameIdentifier": "0000000929", "nameIdentifierScheme": "筑波大学研究者総覧", "nameIdentifierURI": "http://trios.tsukuba.ac.jp/researcher/0000000929"}]}, {"creatorNames": [{"creatorName": "佐野, 良夫"}], "nameIdentifiers": [{"nameIdentifier": "109815", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "20650261", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://nrid.nii.ac.jp/ja/nrid/1000020650261"}, {"nameIdentifier": "0000003333", "nameIdentifierScheme": "筑波大学研究者総覧", "nameIdentifierURI": "http://trios.tsukuba.ac.jp/researcher/0000003333"}]}]}, "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": [{"nameIdentifier": "196903", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sano, Yoshio"}], "nameIdentifiers": [{"nameIdentifier": "196904", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Tsuruda, Takahiro"}], "nameIdentifiers": [{"nameIdentifier": "196905", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2019-07-01"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "OL_12-5.pdf", "filesize": [{"value": "75.4 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 75400.0, "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"], "permalink_uri": "http://hdl.handle.net/2241/00153141", "pubdate": {"attribute_name": "公開日", "attribute_value": "2018-09-04"}, "publish_date": "2018-09-04", "publish_status": "0", "recid": "47769", "relation": {}, "relation_version_is_last": true, "title": ["Computing Kitahara–Mizuno’s bound on the number of basic feasible solutions generated with the simplex algorithm"], "weko_shared_id": 5}
Computing Kitahara–Mizuno’s bound on the number of basic feasible solutions generated with the simplex algorithm
http://hdl.handle.net/2241/00153141
http://hdl.handle.net/2241/001531410994dc89-b44c-4818-a818-4ec35994e494
名前 / ファイル | ライセンス | アクション |
---|---|---|
OL_12-5 (75.4 kB)
|
|
Item type | Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2018-09-04 | |||||
タイトル | ||||||
タイトル | Computing Kitahara–Mizuno’s bound on the number of basic feasible solutions generated with the simplex algorithm | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源 | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
著者 |
Kuno, Takahito
× Kuno, Takahito× Sano, Yoshio× Tsuruda, Takahiro |
|||||
著者別名 |
久野, 誉人
× 久野, 誉人× 佐野, 良夫 |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | 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 γ. | |||||
書誌情報 |
Optimization letters 巻 12, 号 5, p. 933-943, 発行日 2018-07 |
|||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 1862-4472 | |||||
書誌レコードID | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AA12249544 | |||||
DOI | ||||||
識別子タイプ | DOI | |||||
関連識別子 | 10.1007/s11590-018-1276-4 | |||||
権利 | ||||||
権利情報 | © Springer-Verlag GmbH Germany, part of Springer Nature 2018 | |||||
著者版フラグ | ||||||
値 | author | |||||
出版者 | ||||||
出版者 | Springer |