Part of the Telecommunication Networks and Computer Systems book series (TNCS)
Up to this point we have assumed that an arriving object is admitted into the knapsack whenever there is sufficient room. Such a policy is called complete sharing.
KeywordsOptimal Policy Admission Control Admission Policy Revenue Function Average Revenue
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag London Limited 1995