Lower bounds for the Quadratic Semi-Assignment Problem by

  title={Lower bounds for the Quadratic Semi-Assignment Problem by},
  author={Federico Malucelli and D. Pretolani},
This paper present a class of lower bounds for the Quadratic SemiAssignment 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… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
15 Extracted Citations
29 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 29 references

, " An algorithm for the multiprocessor assignment problem "

  • V. F. Magirou, J. Z. Milis
  • Operations Research Letters
  • 1989
Highly Influential
4 Excerpts

ÒA package based on the bundle idea for maximising a piecewise linear concave functionÓ

  • P Carraresi, A. Frangioni, M. Nonato
  • 1994

ÒA polynomially solvable class of quadratic semi - assignment problemsÓ , Dipartimento di Informatica - Universit ˆ di Pisa

  • F Malucelli
  • 1994
1 Excerpt

ÒA polynomially solvable class of quadratic semi-assignment problemsÓ

  • F. Malucelli
  • 1994
1 Excerpt

ÒLower bounds for the quadratic semi-assignment problemÓ, CRT - UniversitŽ de Montreal, CRT-955

  • F Malucelli, D. Pretolani
  • 1993
2 Excerpts

Tabu search techniques for the Quadratic SemiAssignment Problem in New Directions

  • W Domschke, P. Forst, S. Voss
  • For Operations Research In Manufacturing Berlin…
  • 1992

ÒAn efficient algorithm for task allocation problemÓ

  • A Billionet, M. C. Costa, A. Sutter
  • Journal of ACM
  • 1992

Similar Papers

Loading similar papers…