A single-resource allocation problem with Poisson resource requirements Academic Article

abstract

• We consider a stochastic resource allocation problem that generalizes the knapsack problem to account for random item weights that follow a Poisson distribution. When the sum of realized weights exceeds capacity, a penalty cost is incurred. We wish to select the items that maximize expected profit. We provide an effective solution method and illustrate the advantages of this approach via computational experiments. Springer-Verlag 2009.

authors

• Geunes, Joseph

published proceedings

• OPTIMIZATION LETTERS

author list (cited authors)

• Agrali, S., & Geunes, J.

citation count

• 6

complete list of authors

• Agrali, Semra||Geunes, Joseph

publication date

• September 2009

publisher

• Springer Nature  Publisher

published in

• Optimization Letters  Journal

keywords

• Nonlinear Programming
• Stochastic Knapsack Problem

Digital Object Identifier (DOI)

• 10.1007/s11590-009-0135-8

start page

• 559

end page

• 571

volume

• 3

issue

• 4

URL

• http://dx.doi.org/10.1007/s11590-009-0135-8