Monotonicity properties for the stochastic knapsack

DOI10.1109/18.57223zbMath0737.90024OpenAlexW1977197384MaRDI QIDQ3986492

David D. W. Yao, Keith W. Ross

Publication date: 27 June 1992

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.57223

zbMATH Keywords

loss networksmulticlass blocking system

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queues and service in operations research (90B22)

Related Items (8)

Exact algorithms for the 0-1 time-bomb knapsack problem ⋮ An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem ⋮ Admission and routing control with partial information and limited buffers ⋮ Optimal static pricing for a tree network ⋮ Exponential penalty function control of loss networks ⋮ Optimality of randomized trunk reservation for a problem with a single constraint ⋮ The asymptotic value-to-capacity ratio for the multi-class stochastic knapsack problem ⋮ A critically loaded multiclass Erlang loss system

This page was built for publication: Monotonicity properties for the stochastic knapsack