
doi: 10.1287/mnsc.5.1.44
This paper will be concerned with formulating the optimum allocation of search effort as a problem in convex programming so that their solutions may be made amenable to treatment by the adjacent extreme point methods of linear programming. Attention will be concentrated on discrete (statistical) distributions because this class of cases admits of the easiest and most straight-forward treatment. A sketch will then be given of how extensions may also be effected to continuous distributions.
Search theory
Search theory
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 68 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
