Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/147553
Authors: 
Büther, Marcel
Year of Publication: 
2008
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 634
Abstract: 
The elastic generalized assignment problem (eGAP) is a natural extension of the generalized assignment problem (GAP) where the capacities are not any longer fixed but can be adjusted which is expressed by continuous variables. These variables might be unbounded or restricted by a lower or upper bound, respectively. This paper describes an algorithm based on beam search, combined with Lagrangian relaxation and local search to provide strong lower as well as upper bounds for the eGAP.
Subjects: 
elastic generalized assignment problem
mixed integer programming
beam search
Lagrangian relaxation
local search
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.