書誌事項
- タイトル別名
-
- Minimum-Variance Discrete Resource Allocation
- ブンサン サイショウカ リサン シゲン ハイブン モンダイ
この論文をさがす
説明
This paper treats an allocation of a fixed amount of discrete resources to a set of activities so that the performances of activities resulted from the allocation are balanced as much as possible. However, the perfect balanced allocation is not possible, in general, due to the discreteness of resources. So, our aim is to minimize imbalance among the performances. We consider the variance of the performances among activities as a measure of the imbalance. Thus, our problem is formulated as a minimum-variance resource allocation problem. We propose a branch-and-bound algorithm whose experimental computer program was run on 12, 000 examples.
収録刊行物
-
- 日本応用数理学会論文誌
-
日本応用数理学会論文誌 8 (3), 389-404, 1998
一般社団法人 日本応用数理学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390282680744447360
-
- NII論文ID
- 110001883699
-
- NII書誌ID
- AN10367166
-
- ISSN
- 09172246
- 24240982
-
- NDL書誌ID
- 4562699
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- NDL
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可