scientific article; zbMATH DE number 4027174
A mathematical model of the quadratic assignment problem is: \[ (1)\quad \min \{z(X) = \sum^{n}_{i=1}\sum^{n}_{p=1}a_{ip}x_{ip}+\sum^{n}_{i=1}\sum^{n}_{p=1}\sum^{n}_{j=1}\sum^{n}_{q=1}c_{ipjq}x_{ip}x_{ jq}| \quad x\in {\mathcal A}\} \] where \({\mathcal A}\in B_ 2^{n^ 2}\) is the set satisfying the following constraints: \[ (2)\quad \sum^{n}_{i=1}x_{ip}=1\quad (1\leq p\leq n),\quad \sum^{n}_{p=1}x_{ip}=1\quad (1\leq i\leq n),\quad x_{ip}=0,1\quad (1\leq i,p\leq n). \] \textit{P. C. Gilmore} [SIAM J. Appl. Math. 10, 305-313 (1962; Zbl 0118.151)] and \textit{E. L. Lawler} [Manage. Sci. 19, 586-590 (1962)] gave the same estimate of the lower bound of the optimal solution of problem (1). In this paper the author proposes a new bounding technique for (1). Computational comparison between this and other existing bounding techniques is carried out through a large number of test problems.
- Strengthening Gilmore's bound for the quadratic assignment problem
- A new form of the quadratic assignment problem and approximate solutions
- The quadratic assignment problem. I: New lower bounds in paired assignment
- scientific article; zbMATH DE number 4143776 (Why is no real title available?)
- A new lower bound for the quadratic assignment problem
- scientific article; zbMATH DE number 4091183 (Why is no real title available?)
- A New Lower Bound for the Quadratic Assignment Problem
- scientific article; zbMATH DE number 714534 (Why is no real title available?)
- A new bound for the quadratic assignment problem based on convex quadratic programming
- Bounds for the quadratic assignment problem using the bundle method
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768679)