@inproceedings{d450f84a37f94aff9402a91f6d034989,
title = "Note on a class of admission control policies for the stochastic knapsack problem",
abstract = "In this note we discuss a class of exponential penalty function policies recently proposed by Iyengar and Sigman for controlling a stochastic knapsack. These policies are based on the optimal solution of some related deterministic linear programs. By finding explicitly their optimal solution, we reinterpret the exponential penalty function policies and show that they belong to the class of threshold policies. This explains their good practical behavior, facilitates the comparison with the thinning policy, simplifies considerably their analysis and improves the bounds previously proposed.",
author = "A.F. Gabor and \{Ommeren, van\}, J.C.W.",
year = "2006",
doi = "10.1007/11775096\_20",
language = "English",
isbn = "3-540-35157-4",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "207--219",
editor = "S.W. Cheng and C.K. Poon",
booktitle = "Algorithmic Aspects in Information and Management (Proceedings Second International Conference, AAIM'06, Hong Kong, June 20-22, 2006)",
address = "Germany",
}