Best reduction of the quadratic semi-assignment problem

Abstract We consider the quadratic semi-assignment problem in which we minimize a quadratic pseudo-Boolean function F subject to the semi-assignment constraints. We propose in this paper a linear programming method to obtain the best reduction of this problem, i.e. to compute the greatest constant c such that F is equal to c plus F′ for all feasible solutions, F′ being a quadratic pseudo-Boolean function with nonnegative coefficients. Thus constant c can be viewed as a generalization of the height of an unconstrained quadratic 0–1 function introduced in (Hammer et al., Math. Program. 28 (1984) 121–155), to constrained quadratic 0–1 optimization. Finally, computational experiments proving the practical usefulness of this reduction are reported.

[1]  Zvi Drezner,et al.  Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming , 1995, Oper. Res..

[2]  J. Rhys.  A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .

[3]  Alain Billionnet,et al.  An efficient algorithm for a task allocation problem , 1992, JACM.

[4]  Manfred Padberg,et al.  Location, Scheduling, Design and Integer Programming , 2011, J. Oper. Res. Soc..

[5]  Alan M. Frieze,et al.  On the quadratic assignment problem , 1983, Discret. Appl. Math..

[6]  Warren P. Adams,et al.  A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems , 1986 .

[7]  Alain Billionnet,et al.  A Lower Bound for a Constrained Quadratic 0-1 Minimization Problem , 1997, Discret. Appl. Math..

[8]  Bruno Simeone,et al.  Optimal grouping of researchs into departments , 1991 .

[9]  Pierre Hansen,et al.  Roof duality, complementation and persistency in quadratic 0–1 optimization , 1984, Math. Program..

[10]  Alain Faye.  Programmation quadratique en variables bivalentes sous contraintes linéaires. Application au placement de taches dans les systèmes distribués et a la partition de graphes , 1994 .

[11]  Alain Billionnet,et al.  Unconstrained 0-1 optimization and Lagrangean relaxation , 1990, Discret. Appl. Math..

[12]  Warren P. Adams,et al.  Improved Linear Programming-based Lower Bounds for the Quadratic Assignment Proglem , 1993, Quadratic Assignment and Related Problems.