Büsing, ChristinaKoster, Arie M. C. A.Kutschka, Manuel2021-12-172021-12-1720102197-8085https://depositonce.tu-berlin.de/handle/11303/15686http://dx.doi.org/10.14279/depositonce-14459Admission control problems have been studied extensively in the past. In a typical setting, resources like bandwidth have to be distributed to the different customers according to their demands maximizing the profit of the company. Yet, in real-world applications those demands are deviating and in order to satisfy their service requirements often a robust approach is chosen wasting benefits for the company. Our model overcomes this problem by allowing a limited recovery of a previously fixed assignment as soon as the data are known by violating at most k service promises and serving up to l new customers. Applying this approaches to the call admission problem on a single link of a telecommunication network leads to a recoverable robust version of the knapsack problem.en510 Mathematikadmission controlrecoverable robustnessknapsackextended cover inequalitiesResearch Paper