Repulsive assignment problem (Articolo in rivista)

Type
Label
  • Repulsive assignment problem (Articolo in rivista) (literal)
Anno
  • 2010-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1007/s10957-009-9601-9 (literal)
Alternative label
  • M. Gaudioso; L. Moccia; M. F. Monaco (2010)
    Repulsive assignment problem
    in Journal of optimization theory and applications; SPRINGER, DORDRECHT (Paesi Bassi)
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • M. Gaudioso; L. Moccia; M. F. Monaco (literal)
Pagina inizio
  • 255 (literal)
Pagina fine
  • 273 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://dx.doi.org/10.1007/s10957-009-9601-9 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 144 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali
  • 19 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
  • 2 (literal)
Note
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Dipartimento di Elettronica Informatica e Sistemistica, Università della Calabria, Via P. Bucci 41C, 87036 Rende (CS), Italy Istituto di Calcolo e Reti ad Alte Prestazioni, Consiglio Nazionale delle Ricerche, Via P. Bucci 41C, 87036 Rende (CS), Italy (literal)
Titolo
  • Repulsive assignment problem (literal)
Abstract
  • Standard assignment is the problem of obtaining a matching between two sets of respectively persons and positions so that each person is assigned exactly one position and each position receives exactly one person, while a linear decision maker utility function is maximized. We introduce a variant of the problem where the persons individual utilities are taken into account in a way that a feasible solution must satisfy not only the standard assignment constraints, but also an equilibrium constraint of the complementarity type, which we call repulsive. The equilibrium constraint can be, in turn, transformed into a typically large set of linear constraints. Our problem is NP-hard and it is a special case of the assignment problem with side constraints. We study an exact penalty function approach which motivates a heuris- tic algorithm. We provide computational experiments that show the usefulness of a heuristic mechanism inspired by the exact approach. The heuristics outperforms a state-of-the-art integer linear programming solver. (literal)
Editore
Prodotto di
Autore CNR

Incoming links:


Prodotto
Autore CNR di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Editore di
data.CNR.it