ログイン
言語:

WEKO3

  • トップ
  • コミュニティ
  • ランキング
AND
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_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"}, "item_10_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "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"}]}]}, "item_10_description_4": {"attribute_name": "\u6284\u9332", "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_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": "\u51fa\u7248\u8005", "attribute_value_mlt": [{"subitem_publisher": "\u65e5\u672c\u30aa\u30da\u30ec\u30fc\u30b7\u30e7\u30f3\u30ba\u30fb\u30ea\u30b5\u30fc\u30c1\u5b66\u4f1a"}]}, "item_10_relation_43": {"attribute_name": "\u7570\u7248\u3067\u3042\u308b", "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": "\u8457\u8005\u7248\u30d5\u30e9\u30b0", "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": "ISSN"}]}, "item_10_text_14": {"attribute_name": "\u30d5\u30a9\u30fc\u30de\u30c3\u30c8", "attribute_value_mlt": [{"subitem_text_value": "application/pdf"}]}, "item_creator": {"attribute_name": "\u8457\u8005", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Umetani, Shunji"}], "nameIdentifiers": [{"nameIdentifier": "29893", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Yagiura, Mutsunori"}], "nameIdentifiers": [{"nameIdentifier": "29894", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "\u67f3\u6d66, \u7766\u61b2"}], "nameIdentifiers": [{"nameIdentifier": "29895", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "\u30d5\u30a1\u30a4\u30eb\u60c5\u5831", "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_free", "mimetype": "application/pdf", "size": 330000.0, "url": {"label": "50-4-350-375.pdf", "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": "\u30ad\u30fc\u30ef\u30fc\u30c9", "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": "\u8a00\u8a9e", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "\u8cc7\u6e90\u30bf\u30a4\u30d7", "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": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM"}]}, "item_type_id": "10", "owner": "1", "path": ["312/313/314"], "permalink_uri": "http://hdl.handle.net/2237/11724", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "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": 3}
  1. A500 情報学部/情報学研究科・情報文化学部・情報科学研究科
  2. A500a 雑誌掲載論文
  3. 学術雑誌

RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM

http://hdl.handle.net/2237/11724
0e20b612-9d90-4e31-a8a2-3bd586d03fec
名前 / ファイル ライセンス アクション
50-4-350-375.pdf 50-4-350-375.pdf (330.0 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2009-05-11
タイトル
タイトル RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM
著者 Umetani, Shunji

× Umetani, Shunji

WEKO 29893

Umetani, Shunji

Search repository
Yagiura, Mutsunori

× Yagiura, Mutsunori

WEKO 29894

Yagiura, Mutsunori

Search repository
柳浦, 睦憲

× 柳浦, 睦憲

WEKO 29895

柳浦, 睦憲

Search repository
キーワード
主題Scheme Other
主題 Combinatorial optimization
キーワード
主題Scheme Other
主題 set covering problem
キーワード
主題Scheme Other
主題 linear programming
キーワード
主題Scheme Other
主題 Lagrangian relaxation
キーワード
主題Scheme Other
主題 subgradient method
キーワード
主題Scheme Other
主題 heuristic algorithm
抄録
内容記述 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.
内容記述タイプ Abstract
出版者
出版者 日本オペレーションズ・リサーチ学会
言語
言語 eng
資源タイプ
資源タイプresource http://purl.org/coar/resource_type/c_6501
タイプ journal article
関連情報
関連タイプ isVersionOf
関連識別子
識別子タイプ URI
関連識別子 http://www.orsj.or.jp/~oldweb/e-Library/50-4-350-375.pdf
ISSN
収録物識別子タイプ ISSN
収録物識別子 0453-4514
書誌情報 Journal of the Operations Research Society of Japan

巻 50, 号 4, p. 350-375, 発行日 2007-12
フォーマット
application/pdf
著者版フラグ
値 publisher
URI
識別子 http://hdl.handle.net/2237/11724
識別子タイプ HDL
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 11:54:07.703908
Show All versions

Share

Mendeley CiteULike Twitter Facebook Print Addthis

Cite as

Export

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by CERN Data Centre & Invenio


Powered by CERN Data Centre & Invenio