Author:
Moiseev Konstantin,Kolodny Avinoam,Wimer Shmuel
Reference19 articles.
1. R. E. Burkard, E. Cela, G. Rote and G. J. Woeginger, “The quadratic assignment problem with monotone anti-Monge and symmetric Toeplitz matrix: easy and hard cases,” Mathematical Programming, Vol. 82, 1998, pp. 125–158.
2. V. Deineko, B. Klinz and G. J. Woeginger, “Four Point Conditions and Exponential Neighborhoods for Symmetric TSP,” SODA ’06, January 22–26, Miami, FL.
3. V. M. Demidenko, G. Finke and V. S. Gordon, “Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices,” Journal of Mathematical Modeling and Algorithms, 2006, pp. 167–197.
4. B. Emanuel, S. Wimer and G. Wolansky, “Using well-solvable quadratic assignment problems for VLSI interconnect applications,” Discrete Applied Mathematics, 2011, doi: 10.1016/j.dam.2011.11.017
5. P. Gritzmann, M. Ritter and P. Zuber, “Optimal wire ordering and spacing in low power semiconductor design,” Mathematical Programming, Vol. 121, No. 2, 2010, pp. 201–220.