A collection of electronically available data instances for the quadratic assignment problem is described. For each instance, we provide detailed information, indicating whether or not the problem is solved to optimality. If not, we supply the best known bounds for the problem. Moreover we survey available software and describe recent dissertations related to the quadratic assignment problem. The paper is an updated version of a previous paper of the authors [Eur. J. Oper. Res. 55, No. 1, 115--119 (1991)].

References in zbMATH (referenced in 197 articles , 2 standard articles )

Showing results 1 to 20 of 197.
Sorted by year (citations)

1 2 3 ... 8 9 10 next

  1. Bravo Ferreira, José F.S.; Khoo, Yuehaw; Singer, Amit: Semidefinite programming approach for the quadratic assignment problem with a sparse graph (2018)
  2. Delorme, Maxence; Iori, Manuel; Martello, Silvano: BPPLIB: a library for bin packing and cutting stock problems (2018)
  3. Hu, Hao; Sotirov, Renata: Special cases of the quadratic shortest path problem (2018)
  4. Kukal, Jaromír; Mojzeš, Matej: Quantile and mean value measures of search process complexity (2018)
  5. Alcaide-López-de-Pablo, David; Sicilia, Joaquín; González-Sierra, Miguel Á.: Locating names on vertices of a transaction network (2017)
  6. Arima, Naohiko; Kim, Sunyoung; Kojima, Masakazu; Toh, Kim-Chuan: A robust Lagrangian-DNN method for a class of quadratic optimization problems (2017)
  7. Dai, Xiaoying; Liu, Zhuang; Zhang, Liwei; Zhou, Aihui: A conjugate gradient method for electronic structure calculations (2017)
  8. Xudong Li, Defeng Sun, Kim-Chuan Toh: On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope (2017) arXiv
  9. Ahmed, Zakir Hussain: Experimental analysis of crossover and mutation operators on the quadratic assignment problem (2016)
  10. De Santis, M.; Festa, P.; Liuzzi, G.; Lucidi, S.; Rinaldi, F.: A nonmonotone GRASP (2016)
  11. Elloumi, Sourour; Lambert, Amélie: Comparison of quadratic convex reformulations to solve the Quadratic Assignment problem (2016)
  12. Jiang, Bo; Liu, Ya-Feng; Wen, Zaiwen: $L_p$-norm regularization algorithms for optimization over permutation matrices (2016)
  13. John, Maximilian; Karrenbauer, Andreas: A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases (2016)
  14. Lalla-Ruiz, Eduardo; Expósito-Izquierdo, Christopher; Melián-Batista, Belén; Moreno-Vega, J.Marcos: A hybrid biased random key genetic algorithm for the quadratic assignment problem (2016)
  15. Sun, Defeng; Toh, Kim-Chuan; Yang, Liuqin: An efficient inexact ABCD method for least squares semidefinite programming (2016)
  16. Zhang, Huizhen; Li, Qian; Cesar, Beltran-Royo: A new solution method based on Lagrangian relaxation for the quadratic assignment problem (2016)
  17. Ahmed, Zakir Hussain: A multi-parent genetic algorithm for the quadratic assignment problem (2015)
  18. de Klerk, E.; Sotirov, R.; Truetsch, U.: A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives (2015)
  19. Drugan, Mădălina M.: Generating QAP instances with known optimum solution and additively decomposable cost function (2015)
  20. Gueye, Serigne; Michelon, Philippe: A linear formulation with $O(n^2)$ variables for quadratic assignment problems with Manhattan distance matrices (2015)

1 2 3 ... 8 9 10 next

Further publications can be found at: