The generalized assignment problem (GAP) asks to assign nclients to mservers in such a way that the assignment cost is minimized, provided that all clients are assigned to a server and that the capacity of each server is not exceeded. It is a problem that appears, by itself or as a subproblem, in a very high number of practical applications and has therefore been intensively studied. We use this problem as a test case example of all algorithms presented in the text. This section reviews the state of the art of research on GAP and shows the application of several mathematical programming techniques on GAP instances.
The Generalized Assignment Problem / Maniezzo, Vittorio; Boschetti, Marco Antonio; Stützle, Thomas. - STAMPA. - (2021), pp. 3-33. [10.1007/978-3-030-70277-9_1]
The Generalized Assignment Problem
Maniezzo, Vittorio;Boschetti, Marco Antonio;
2021
Abstract
The generalized assignment problem (GAP) asks to assign nclients to mservers in such a way that the assignment cost is minimized, provided that all clients are assigned to a server and that the capacity of each server is not exceeded. It is a problem that appears, by itself or as a subproblem, in a very high number of practical applications and has therefore been intensively studied. We use this problem as a test case example of all algorithms presented in the text. This section reviews the state of the art of research on GAP and shows the application of several mathematical programming techniques on GAP instances.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
