Documents disponibles écrits par cet auteur

Reducing the elastic generalized assignment problem to the standard generalized assignment problem / M. Büther in Journal of the operational research society (JORS), Vol. 61 N° 11 (Novembre 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1582–1595 Titre : Reducing the elastic generalized assignment problem to the standard generalized assignment problem Type de document : texte imprimé Auteurs : M. Büther, Auteur Année de publication : 2011 Article en page(s) : pp. 1582–1595 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Assignment  Binary  representation  Qapacity  planning  Combinatorial  optimization  Mixed  integer  programming Index. décimale : 001.424 Résumé : 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. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009108a.html [article] Reducing the elastic generalized assignment problem to the standard generalized assignment problem [texte imprimé] / M. Büther, Auteur . - 2011 . - pp. 1582–1595. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1582–1595 Mots-clés : Assignment  Binary  representation  Qapacity  planning  Combinatorial  optimization  Mixed  integer  programming Index. décimale : 001.424 Résumé : 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. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009108a.html