Arbeitspapier

Beam search for the elastic generalized assignment problem

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.

Language
Englisch

Bibliographic citation
Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; No. 634

Classification
Management
Subject
elastic generalized assignment problem
mixed integer programming
beam search
Lagrangian relaxation
local search
binary representation
Mathematische Optimierung
Theorie

Event
Geistige Schöpfung
(who)
Büther, Marcel
Event
Veröffentlichung
(who)
Universität Kiel, Institut für Betriebswirtschaftslehre
(where)
Kiel
(when)
2008

Handle
Last update
10.03.2025, 11:41 AM CET

Data provider

This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.

Object type

  • Arbeitspapier

Associated

  • Büther, Marcel
  • Universität Kiel, Institut für Betriebswirtschaftslehre

Time of origin

  • 2008

Other Objects (12)