Publication:4452814
From MaRDI portal
zbMath1073.90524MaRDI QIDQ4452814
Publication date: 2 March 2004
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C27: Combinatorial optimization
90B80: Discrete location and assignment
Related Items
Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods, A survey for the quadratic assignment problem, A branch-and-cut algorithm for quadratic assignment problems based on linearizations, A level-2 reformulation-linearization technique bound for the quadratic assignment problem, Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique, The quadratic three-dimensional assignment problem: exact and approximate solution methods, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs, Iterated local search for the quadratic assignment problem, A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices