ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "ee3ffb3c-3805-47d7-b1ea-ed6b75138c19"}, "_deposit": {"created_by": 15, "id": "65", "owners": [15], "pid": {"revision_id": 0, "type": "depid", "value": "65"}, "status": "published"}, "_oai": {"id": "oai:edo.repo.nii.ac.jp:00000065", "sets": ["6"]}, "author_link": ["72", "11"], "item_10002_description_5": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "Lot-sizing problem has been extensively researched in many aspects. In this review, we summarize key points of dynamic programming algorithms in lot-sizing problems and give some hints helping further designing algorithms for more variations of lot-sizing problems ([4]).", "subitem_description_type": "Abstract"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "ザン, ピン"}, {"creatorName": "ザン, ピン", "creatorNameLang": "ja-Kana"}], "nameIdentifiers": [{"nameIdentifier": "72", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Zhan, Ping", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "11", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2013-12-13"}], "displaytype": "simple", "download_preview_message": "", "file_order": 0, "filename": "27.zhan_22.pdf", "filesize": [{"value": "920.1 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 920100.0, "url": {"label": "Dynamic Programming Algorithms for Lot-Sizing Problems", "url": "https://edo.repo.nii.ac.jp/record/65/files/27.zhan_22.pdf"}, "version_id": "7290d580-859a-4907-b49c-83c84b3d5605"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "Lot-sizing", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Dynamic programming", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Minimum cost flows", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "jpn"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "departmental bulletin paper", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Dynamic Programming Algorithms for Lot-Sizing Problems", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Dynamic Programming Algorithms for Lot-Sizing Problems"}]}, "item_type_id": "10002", "owner": "15", "path": ["6"], "permalink_uri": "https://edo.repo.nii.ac.jp/records/65", "pubdate": {"attribute_name": "公開日", "attribute_value": "2013-12-13"}, "publish_date": "2013-12-13", "publish_status": "0", "recid": "65", "relation": {}, "relation_version_is_last": true, "title": ["Dynamic Programming Algorithms for Lot-Sizing Problems"], "weko_shared_id": -1}
  1. 江戸川大学紀要
  2. 江戸川大学紀要 第22号(2012)

Dynamic Programming Algorithms for Lot-Sizing Problems

https://edo.repo.nii.ac.jp/records/65
https://edo.repo.nii.ac.jp/records/65
eeb5f719-58c4-4419-9741-5da613a79a59
名前 / ファイル ライセンス アクション
27.zhan_22.pdf Dynamic Programming Algorithms for Lot-Sizing Problems (920.1 kB)
Item type 紀要論文 / Departmental Bulletin Paper(1)
公開日 2013-12-13
タイトル
タイトル Dynamic Programming Algorithms for Lot-Sizing Problems
言語
言語 jpn
キーワード
言語 en
主題Scheme Other
主題 Lot-sizing
キーワード
言語 en
主題Scheme Other
主題 Dynamic programming
キーワード
言語 en
主題Scheme Other
主題 Minimum cost flows
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ departmental bulletin paper
著者 ザン, ピン

× ザン, ピン

WEKO 72

ザン, ピン

ja-Kana ザン, ピン

Search repository
Zhan, Ping

× Zhan, Ping

WEKO 11

en Zhan, Ping

Search repository
抄録
内容記述タイプ Abstract
内容記述 Lot-sizing problem has been extensively researched in many aspects. In this review, we summarize key points of dynamic programming algorithms in lot-sizing problems and give some hints helping further designing algorithms for more variations of lot-sizing problems ([4]).
戻る
0
views
See details
Views

Versions

Ver.1 2023-06-19 08:31:42.486253
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

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

Confirm


Powered by WEKO3


Powered by WEKO3