Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/147551 
Authors: 
Year of Publication: 
2007
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel No. 632
Publisher: 
Universität Kiel, Institut für Betriebswirtschaftslehre, Kiel
Abstract: 
The elastic generalized assignment problem (eGAP) is a natural extension of the generalized assignment problem (GAP) where the capacities are not fixed but can be adjusted which is expressed by continuous variables. These variables might be un-bounded or restricted by a lower or upper bound, respectively. This paper concerns techniques in order to reduce several variants of eGAP to GAP which enables us to employ Standard approaches for the GAP. This results into an heuristic, which can be customized in order to provide solutions having an objective value arbitrarily close to the optimal one.
Subjects: 
elastic generalized assignment problem
mixed integer programming
reformulation
binary representation
Document Type: 
Working Paper

Files in This Item:
File
Size





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