QAPLIB

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 178 articles , 2 standard articles )

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

1 2 3 ... 7 8 9 next

  1. Ahmed, Zakir Hussain: Experimental analysis of crossover and mutation operators on the quadratic assignment problem (2016)
  2. De Santis, M.; Festa, P.; Liuzzi, G.; Lucidi, S.; Rinaldi, F.: A nonmonotone GRASP (2016)
  3. Jiang, Bo; Liu, Ya-Feng; Wen, Zaiwen: $L_p$-norm regularization algorithms for optimization over permutation matrices (2016)
  4. 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)
  5. Sun, Defeng; Toh, Kim-Chuan; Yang, Liuqin: An efficient inexact ABCD method for least squares semidefinite programming (2016)
  6. de Klerk, E.; Sotirov, R.; Truetsch, U.: A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives (2015)
  7. Drugan, Mădălina M.: Generating QAP instances with known optimum solution and additively decomposable cost function (2015)
  8. Gueye, Serigne; Michelon, Philippe: A linear formulation with $O(n^2)$ variables for quadratic assignment problems with Manhattan distance matrices (2015)
  9. Pardo, Eduardo G.; Soto, Mauricio; Thraves, Christopher: Embedding signed graphs in the line (2015)
  10. Peng, Jiming; Zhu, Tao; Luo, Hezhi; Toh, Kim-Chuan: Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (2015)
  11. Xia, Yong; Gharibi, Wajeb: On improving convex quadratic programming relaxation for the quadratic assignment problem (2015)
  12. Yang, Liuqin; Sun, Defeng; Toh, Kim-Chuan: SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints (2015)
  13. Adams, Warren; Waddell, Lucas: Linear programming insights into solvable cases of the quadratic assignment problem (2014)
  14. Lai, Rongjie; Osher, Stanley: A splitting method for orthogonality constrained problems (2014)
  15. Rostami, Borzou; Malucelli, Federico: A revised reformulation-linearization technique for the quadratic assignment problem (2014)
  16. Salvagnin, Domenico: Detecting and exploiting permutation structures in mips (2014)
  17. Amaral, André R.S.: A parallel ordering problem in facilities layout (2013)
  18. Czapiński, Michał: An effective parallel multistart tabu search for quadratic assignment problem on CUDA platform (2013)
  19. Nyberg, Axel; Westerlund, Tapio; Lundell, Andreas: Improved discrete reformulations for the quadratic assignment problem (2013)
  20. Schmitzer, Bernhard; Schnörr, Christoph: Modelling convex shape priors and matching based on the Gromov-Wasserstein distance (2013)

1 2 3 ... 7 8 9 next