Quadratic Semi-Assignment Problems on structured graphs

Quadratic Semi-Assignment Problems on structured graphs

0.00 Avg rating0 Votes
Article ID: iaor19951081
Country: Italy
Volume: 24
Issue: 69
Start Page Number: 57
End Page Number: 78
Publication Date: Mar 1994
Journal: Ricerca Operativa
Authors: ,
Abstract:

The paper presents a class of polynomially solvable instances of the Quadratic Semi-Assignment Problem. Some properties of this class are illustrated. In the light of these results lower bounds and solution techniques for the general case are proposed. A computational comparison of some lower bounds is reported.

Reviews

Required fields are marked *. Your email address will not be published.