Best reduction of the quadratic semi-assignment problem

Discrete Applied Mathematics

Volumn 109, Issue 3, 2001, Pages 197-213

  Billionnet, Alain ^a   Elloumi, Sourour ^b  

^a CEDRIC   (France)

^b Conservatoire national des arts et métiers   (France)

Author keywords

0 1 quadratic programming; Linear programming; Reduction; Roof duality; Semi assignment problem

Indexed keywords

EID: 0346448292     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00257-2     Document Type: Article

References (16)

1. Adams W.P., Billionnet A., Sutter A. Unconstrained 0-1 optimization and Lagrangean relaxation. Disc. Appl. Math. 29:1990;131-142.
2. W.P. Adams, T.A. Johnson, Improved linear programming-based lower bounds for the quadratic assignment problem. Proceedings of the DIMACS Workshop on Quadratic Assignment Problems DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society 1994, Vol. 16, pp. 43-75.
3. Adams W.P., Sherali H.D. A tight linearization and an algorithm for zero-one quadratic programming problems. Management Sci. 32(10):1986;1274-1290.
4. Billionnet A., Costa A. Sutter M.-C. An efficient algorithm for a task allocation problem. J. Assoc. Comput. Mach. 39(3):1992;502-518.
5. Billionnet A., Faye A. A lower bound for a constrained quadratic 0-1 minimization problem. Disc. Appl. Math. 74:1997;135-146.
6. M. Elf, LP-basierte Schranken fur quadratsche Zuordnungsprobleme mit dunner Zielfunktion, Master's Thesis, Universitat zu Koln, 1999.
7. S. Elloumi, Contribution à la résolution des programmes non linéaires en variables 0-1, application aux problèmes de placement de tâches dans les systèmes distribués, Thèse de Doctorat en informatique, Conservatoire National des Arts et Métiers, Paris, September 1991.
8. A. Faye, Programmation quadratique en variables bivalentes sous contraintes linéaires, Application au placement de tâches dans les systèmes distribués et à la partition de graphes, Thèse de Doctorat en informatique, Conservatoire National des Arts et Métiers, Paris, January 1994.
9. Frieze A.M., Yadegar J. On the Quadratic Assignment Problem. Disc. Appl. Math. 5:1983;89-98.
10. Gallo G., Simeone B. Optimal grouping of researchers into departments. Ricerca Operativa. 57:1991;45-69.
11. Hammer P.L., Hansen P., Simeone B. Roof duality, complementation and persistency in quadratic 0-1 optimization. Math. Program. 28:1984;121-155.
12. V. Kaibel, Polyhedral Methods for the QAP. A chapter written for a book on nonlinear assignment problems, edited by Panos Pardalos and Leonidas Pitsoulis, Kluwer Academic Publishers, Dordrecht, 1999. http: // www.math.TU-Berlin.de/ ~ kaibel / pub.html, to appear.
13. Padberg M.W., Rijal M.P. Location, Scheduling, Design and Integer Programming. 1996;Kluwer Academic Publishers, Dordrecht.
14. Resende M.G.C., Ramakrishnan K.G., Drezner Z. Computing lower bounds for the Quadratic assignment problem with an interior point algorithm for linear programming. Oper. Res. 43(5):1995;781-791.
15. Rhys J. A selection problem of shared fixed costs and networks. Manag. Sci. 17:1970;200-207.
16. A. Sutter, Programmation non linéaire en variables 0-1, application à des problèmes de placement de tâches dans des systèmes distribués, Thèse de Doctorat en informatique, Conservatoire National des Arts et Métiers, Paris, June 1989.