{"_buckets": {"deposit": "2daeea9a-fdb3-4ab7-8ccd-cecf4ac869bc"}, "_deposit": {"id": "9901", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "9901"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00009901", "sets": ["314"]}, "author_link": ["29893", "29894", "29895"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2007-12", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "4", "bibliographicPageEnd": "375", "bibliographicPageStart": "350", "bibliographicVolumeNumber": "50", "bibliographic_titles": [{"bibliographic_title": "Journal of the Operations Research Society of Japan", "bibliographic_titleLang": "en"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "The set covering problem (SCP) is one of representative combinatorial optimization problems, which has many practical applications. The continuous development of mathematical programming has derived a number of impressive heuristic algorithms as well as exact branch-and-bound algorithms, which can solve huge SCP instances of bus, railway and airline crew scheduling problems. We survey heuristic algorithms for SCP focusing mainly on contributions of mathematical programming techniques to heuristics, and illustrate their performance through experimental analysis.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/11724"}]}, "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://www.orsj.or.jp/~oldweb/e-Library/50-4-350-375.pdf", "subitem_relation_type_select": "URI"}}]}, "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": "0453-4514", "subitem_source_identifier_type": "PISSN"}]}, "item_10_text_14": {"attribute_name": "フォーマット", "attribute_value_mlt": [{"subitem_text_value": "application/pdf"}]}, "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": "Umetani, Shunji", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "29893", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Yagiura, Mutsunori", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "29894", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "柳浦, 睦憲", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "29895", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-20"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "50-4-350-375.pdf", "filesize": [{"value": "330.0 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 330000.0, "url": {"label": "50-4-350-375.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/9901/files/50-4-350-375.pdf"}, "version_id": "3b39ad63-6cb0-4c88-9b82-52861b0d3714"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "Combinatorial optimization", "subitem_subject_scheme": "Other"}, {"subitem_subject": "set covering problem", "subitem_subject_scheme": "Other"}, {"subitem_subject": "linear programming", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Lagrangian relaxation", "subitem_subject_scheme": "Other"}, {"subitem_subject": "subgradient method", "subitem_subject_scheme": "Other"}, {"subitem_subject": "heuristic algorithm", "subitem_subject_scheme": "Other"}]}, "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": "RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["314"], "permalink_uri": "http://hdl.handle.net/2237/11724", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2009-05-11"}, "publish_date": "2009-05-11", "publish_status": "0", "recid": "9901", "relation": {}, "relation_version_is_last": true, "title": ["RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM"], "weko_shared_id": -1}