Skip to Main content Skip to Navigation
Journal articles

Best reduction of the quadratic semi-assignment problem

Abstract : 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 by Hammer, Hansen and Simeone, Roof duality, complementation and persistency in quadratic 0-1 optimization (Math. Programming, 28 (1984), pp. 121-195) to constrained quadratic 0-1 optimization. Finally, computational experiments proving the practical usefulness of this reduction are reported.
Complete list of metadatas
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 10:38:43 AM
Last modification on : Friday, January 24, 2020 - 11:00:15 AM


  • HAL Id : hal-01124542, version 1



Alain Billionnet, Sourour Elloumi. Best reduction of the quadratic semi-assignment problem. Discrete Applied Mathematics, Elsevier, 2001, 109, pp.197-213. ⟨hal-01124542⟩



Record views