Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14459
For citation please use:
Main Title: Recoverable Robust Knapsacks: the Discrete Scenario Case
Author(s): Büsing, Christina
Koster, Arie M. C. A.
Kutschka, Manuel
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15686
http://dx.doi.org/10.14279/depositonce-14459
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: Admission 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.
Subject(s): admission control
recoverable robustness
knapsack
extended cover inequalities
Issue Date: 2010
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2010, 18
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-018-2010.pdf
Format: Adobe PDF | Size: 414.16 kB
DownloadShow Preview
Thumbnail

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.