This paper presents a class of lower bounds for the Quadratic Semi-Assignment Problem (QSAP). These bounds are based on recent results on polynomially solvable cases, in particular we will consider the QSAPs whose quadratic cost coefficients define a reducible graph. The idea is to decompose the problem into several subproblems, each defined on a reducible subgraph. A Lagrangean decomposition technique is used to improve the results. Several lower bounds are computationally compared on several types of test problems.
Lower bounds for the quadratic semi-assignment problem / F., Malucelli; Pretolani, Daniele. - In: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0377-2217. - STAMPA. - 83 (2)(1995), pp. 365-375.
Data di pubblicazione: | 1995 |
Titolo: | Lower bounds for the quadratic semi-assignment problem |
Autore/i: | F., Malucelli; Pretolani, Daniele |
Autore/i UNIMORE: | |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1016/0377-2217(95)00013-G |
Rivista: | |
Volume: | 83 (2) |
Pagina iniziale: | 365 |
Pagina finale: | 375 |
Codice identificativo ISI: | WOS:A1995QX23700010 |
Codice identificativo Scopus: | 2-s2.0-0042670451 |
Citazione: | Lower bounds for the quadratic semi-assignment problem / F., Malucelli; Pretolani, Daniele. - In: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0377-2217. - STAMPA. - 83 (2)(1995), pp. 365-375. |
Tipologia | Articolo su rivista |
File in questo prodotto:

I documenti presenti in Iris Unimore sono rilasciati con licenza Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia, salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris