Nederlands
Contact
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
Gabor, A.F. and van Ommeren, J.C.W.
(2006)
Note on a class of admission control policies for the stochastic knapsack problem.
In: Algorithmic Aspects in Information and Management, Proceedings Second International Conference AAIM, June 20-22, 2006, Hong Kong, China.
pp. 207-219.
Lecture Notes in Computer Science 4041.
Springer Verlag.
ISSN 0302-9743
ISBN 3-540-35157-4
Full text available as:
Official URL: http://dx.doi.org/10.1007/11775096_20  AbstractIn 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.
Export this item as: To request a copy of the PDF please email us request copy To correct this item please ask your editor Repository Staff Only: edit this item |
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
