Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms

References

• Ahuja RK, Ergun Ö, Orlin JB, Punnen AP (2002) A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. 123(1):75–102.Crossref, Google Scholar
• Ahuja RK, Ergun Ö, Orlin JB, Punnen AP (2007) Very large-scale neighborhood search: Theory, algorithms, and applications. Gonzalez T, ed. Handbook of Approximation Algorithms and Metaheuristics, vol. 10 (Chapman and Hall/CRC, Boca Raton, FL), 329–344.Google Scholar
• Angel E, Zissimopoulos V (1998) On the quality of local search for the quadratic assignment problem. Discrete Appl. Math. 82(1-3):15–25.Crossref, Google Scholar
• Burkard R, Dell’Amico M, Martello S (2012) Assignment Problems: Revised Reprint (SIAM, Philadelphia).Crossref, Google Scholar
• Burkard RE, Cela 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. Programming 82(1):125–158.Crossref, Google Scholar
• Cela E (2013) The Quadratic Assignment Problem: Theory and Algorithms, vol. 1 (Springer Science & Business Media, Dordrecht).Google Scholar
• Ćustić A, Punnen AP (2017) Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis. Oper. Res. Lett. 45(3):232–237.Crossref, Google Scholar
• Ćustić A, Sokol V, Punnen AP, Bhattacharya B (2017) The bilinear assignment problem: Complexity and polynomially solvable special cases. Math. Programming 166(1-2):185–205.Crossref, Google Scholar
• Feo TA, Resende MG (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8(2):67–71.Crossref, Google Scholar
• Fon-Der-Flaass DG (1997) Arrays of distinct representativesa very simple np-complete problem. Discrete Math. 171(1–3):295–298.Crossref, Google Scholar
• Frieze AM (1983) Complexity of a 3-dimensional assignment problem. Eur. J. Oper. Res. 13(2):161–164.Crossref, Google Scholar
• Glover F, Punnen AP (1997) The travelling salesman problem: New solvable cases and linkages with the development of approximation algorithms. J. Oper. Res. Soc. 48(5):502–510.Crossref, Google Scholar
• Glover F, Ye T, Punnen AP, Kochenberger G (2015) Integrating tabu search and vlsn search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs. Eur. J. Oper. Res. 241(3):697–707.Crossref, Google Scholar
• Hansen P, Mladenović N, Todosijević R, Hanafi S (2016) Variable neighborhood search: Basics and variants. EURO J. Comput. Optim. 5(3):423–454.Crossref, Google Scholar
• Hart JP, Shogan AW (1987) Semi-greedy heuristics: An empirical study. Oper. Res. Lett. 6(3):107–114.Crossref, Google Scholar
• Karapetyan D, Punnen AP (2015) Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem. J. Discrete Applied Math. 193(C):1–10.Google Scholar
• Konno H (1980) Maximizing a convex quadratic function over a hypercube. J. Oper. Res. Soc. Japan. 23(2):171–189.Google Scholar
• Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res. Logist. Quart. 2(1–2):83–97.Crossref, Google Scholar
• Pardalos PM, Wolkowicz H (1994) Quadratic Assignment and Related Problems (American Mathematical Society, Providence, RI).Google Scholar
• Pierskalla WP (1968) Letter to the editor-the multidimensional assignment problem. Oper. Res. 16(2):422–431.Link, Google Scholar
• Punnen AP, Wang Y (2016) The bipartite quadratic assignment problem and extensions. Eur. J. Oper. Res. 250(3):715–725.Crossref, Google Scholar
• Punnen AP, Sripratak P, Karapetyan D (2015) Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms. Theoret. Comput. Sci. 565(1):77–89.Crossref, Google Scholar
• Sahni S, Gonzalez T (1976) P-complete approximation problems. J. ACM 23(3):555–565.Crossref, Google Scholar
• Torki A, Yajima Y, Enkawa T (1996) A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem. Eur. J. Oper. Res. 94(2):384–391.Crossref, Google Scholar
• Tsui LY, Chang CH (1990) A microcomputer based decision support tool for assigning dock doors in freight yards. Comput. Indust. Engrg. 19(1–4):309–312.Crossref, Google Scholar
• Tsui LY, Chang CH (1992) An optimal solution to a dock door assignment problem. Comput. Indust. Engrg. 23(1–4):283–286.Crossref, Google Scholar