scientific article; zbMATH DE number 2049005
From MaRDI portal
Publication:4452814
zbMath1073.90524MaRDI QIDQ4452814
Publication date: 2 March 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (12)
The quadratic three-dimensional assignment problem: exact and approximate solution methods ⋮ A survey for the quadratic assignment problem ⋮ Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs ⋮ A branch-and-cut algorithm for quadratic assignment problems based on linearizations ⋮ A level-2 reformulation-linearization technique bound for the quadratic assignment problem ⋮ A parallel water flow algorithm with local search for solving the quadratic assignment problem ⋮ Experimental analysis of crossover and mutation operators on the quadratic assignment problem ⋮ RLT insights into lift-and-project closures ⋮ Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique ⋮ Iterated local search for the quadratic assignment problem ⋮ A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices ⋮ Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
This page was built for publication: