分散最小化離散資源配分問題

DOI Web Site 被引用文献1件 参考文献10件

書誌事項

タイトル別名
  • 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.

収録刊行物

被引用文献 (1)*注記

もっと見る

参考文献 (10)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ