Abstract
A method using column/constraint generation techniques for solving the quadratic assignment problem (QAP) is described. First, we study the Kaufman-Broeckx linearization of QAP and next, show that the generated cuts have the same structure as the linearization constraints. We also describe an optimal solution to the separation problem. Finally, we discuss different methods for obtaining tighter equivalent formulations of the QAP.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Burkard, R.E., Locations with Spatial Interactions-Quadratic Assignment Problem, Bericht 83-31, Technische Universität Graz, Graz, November 1983.
Crowder and M.V. Padberg, Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality, Management Sci. 26 (1980) 495–509.
Crowder, H., E.L. Johnson and M.W. Padberg, Solving Large-Scale Zero-One Linear Programming Problems, Oper. Res. (1983) 803–834.
Holm, S., A Strengthening of the Kaufman-Broeckx Formulation of the Quadratic Assignment Problem, Odense University, January 1986.
Holm, S. and S. Walukiewicz, Tighter Formulation of the Quadratic Assignment Problem (in preparation).
Dudziński. D. and S. Walukiewicz, Exact Methods for the Knapsack Problem and Its Generalizations, European Journal of Operational Research 28 (1987) 3–21.
Kaki, K. and G.L. Thompson, An Exact Algorithm for the General Quadratic Assignment Problem, European Journal of Operational Research 23 (1986) 382–390.
Kaliszewski, I. and S. Walukiewicz, Tighter Equivalent Formulations for Integer Problems, Report of the Systems Research Institute, Warsaw 1982.
Kaufman, L. and F. Boreckx, An Algorithm for the Quadratic Assignment Problem Using Benders Decomposition, European Journal of Operational Research 2 (1978) 204–211.
Lasdon, L.S., Optimization Theory for Large Systems, The Macmillan Co. 1970.
Padberg, M. and G. Rinaldi, Optimization of a 532-city Symmetric Traveling Salesman Problem by Branch-and-Cut, Oper. Res. Letters (1987) 1–7.
Van Roy, T.J. and L.A. Wolsey, Solving Mixed Integer Programs by Automatic Reformulation, CORE Discussion Paper 8432, Universite Catholique de Louvain, Louvain-la-Neuve, June 1984.
Van Roy, T.J. and L.A. Wolsey, Valid Inequalities for Mixed 0–1 Programs, Discrete Applied Mathematics 14 (1986) 199–213.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 International Federation for Information Processing
About this paper
Cite this paper
Holm, S., Walukiewicz, S. (1988). Column/constraint generation for quadratic assignment problems. In: Iri, M., Yajima, K. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0042797
Download citation
DOI: https://doi.org/10.1007/BFb0042797
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19238-1
Online ISBN: 978-3-540-39164-7
eBook Packages: Springer Book Archive