Reducing the elastic generalized assignment problem to the standard generalized assignment problem
Guardado en:
| Publicado en: | The Journal of the Operational Research Society vol. 61, no. 11 (Nov 2010), p. 1582-1595 |
|---|---|
| Autor principal: | |
| Publicado: |
Taylor & Francis Ltd.
|
| Materias: | |
| Acceso en línea: | Citation/Abstract Full Text Full Text - PDF |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Resumen: | 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; this adjustment can be expressed by continuous variables. These variables might be unbounded or restricted by a lower or upper bound, respectively. This paper concerns techniques aiming at reducing several variants of eGAP to GAP, which enables us to employ standard approaches for the GAP. This results in a heuristic, which can be customized in order to provide solutions having an objective value arbitrarily close to the optimal. [PUBLICATION ABSTRACT] |
|---|---|
| ISSN: | 0160-5682 1476-9360 0030-3623 |
| DOI: | 10.1057/jors.2009.108 |
| Fuente: | ABI/INFORM Global |