Abstract
We consider special cases of the quadratic assignment problem (QAP) that are linearizable in the sense of Bookhold. We provide combinatorial characterizations of the linearizable instances of the weighted feedback arc set QAP, and of the linearizable instances of the traveling salesman QAP. As a by-product, this yields a new well-solvable special case of the weighted feedback arc set problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berenguer X (1979) A characterization of linear admissible transformations for the \(m\)-travelling salesmen problem. Eur J Oper Res 3:232–238
Bookhold I (1990) A contribution to quadratic assignment problems. Optimization 21:933–943
Burkard RE, Çela E, Rote G, Woeginger GJ (1998) The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases. Math Program B 82:125–158
Burkard RE, Deineko VG, van Dal R, van der Veen JAA, Woeginger GJ (1998) Well-solvable special cases of the TSP: a survey. SIAM Rev 40:496–546
Burkard RE, Dell’Amico M, Martello S (2009) Assignment problems. SIAM, Philadelphia
Çela E (1998) The quadratic assignment problem: theory and algorithms. Kluwer Academic Publishers, Dordrecht
Çela E, Deineko VG, Woeginger GJ (2012) Another well-solvable case of the QAP: maximizing the job completion time variance. Oper Res Lett 40:356–359
Deineko VG, Woeginger GJ (1998) A solvable case of the quadratic assignment problem. Oper Res Lett 22:13–17
Erdogan G (2006) Quadratic assignment problem: linearizations and polynomial time solvable cases. Ph.D. Thesis, Bilkent University
Erdogan G, Tansel BC (2007) A branch-and-cut algorithm for quadratic assignment problems based on linearizations. Comput Oper Res 34:1085–1106
Erdogan G, Tansel BC (2011) Two classes of quadratic assignment problems that are solvable as linear assignment problems. Discret Opt 8:446–451
Festa P, Pardalos PM, Resende MGC (2000) Feedback set problems. In: Du DZ, Pardalos PM (eds) Handbook of combinatorial optimization, supplement. Kluwer Academic Publishers, Philip Drive Norwell, pp 209–259
Gabovich E (1976) Constant discrete programming problems on substitute sets (in Russian). Kibernetika (Kiev) 5:128–134 English tranlation inCybernetics 12:786–793 (1977)
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco
Gilmore PC, Lawler EL, Shmoys DB (1985) Well-solved special cases. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (eds) The traveling salesman problem, vol 4. Wiley, Chichester, pp 87–143
Kabadi SN, Punnen AP (2011) An \(O(n^4)\) algorithm for the QAP linearization problem. Math Oper Res 36:754–761
Koopmans TC, Beckmann MJ (1957) Assignment problems and the location of economic activities. Econometrica 25:53–76
Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1985) The traveling salesman problem. Wiley, Chichester
Punnen AP, Kabadi SN (2013) A linear time algorithm for the Koopmans–Beckmann QAP linearization and related problems. Discret Opt 10:200–209
Acknowledgments
Part of this research was conducted while Vladimir Deineko and Gerhard Woeginger were visiting TU Graz, and they both thank the Austrian Science Fund (FWF): W1230, Doctoral Program in “Discrete Mathematics” for the financial support. Vladimir Deineko acknowledges support by Warwick University’s Centre for Discrete Mathematics and Its Applications (DIMAP). Gerhard Woeginger acknowledges support by DIAMANT (a mathematics cluster of the Netherlands Organization for Scientific Research NWO).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Çela, E., Deineko, V.G. & Woeginger, G.J. Linearizable special cases of the QAP. J Comb Optim 31, 1269–1279 (2016). https://doi.org/10.1007/s10878-014-9821-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-014-9821-2