A branch-and-bound-based heuristic for solving the quadratic assignment problem
From MaRDI portal
Publication:3694983
DOI10.1002/nav.3800300210zbMath0575.90041OpenAlexW2057461915MaRDI QIDQ3694983
ömer Kirca, Mokhtar S. Bazaraa
Publication date: 1983
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800300210
Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)
Related Items (17)
Large-scale layout of facilities using a heuristic hybrid algorithm ⋮ The facility layout problem ⋮ A genetic approach to the quadratic assignment problem ⋮ A new exact algorithm for the solution of quadratic assignment problems ⋮ A survey for the quadratic assignment problem ⋮ A heuristic method for the multi-story layout problem ⋮ Backtracking of jobs in one-dimensional machine location problems ⋮ A heuristic procedure for the single-row facility layout problem ⋮ Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple ⋮ A hybrid heuristic for the facilities layout problem ⋮ Directional decomposition heuristic for a linear machine-cell location problem. ⋮ A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem ⋮ A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem ⋮ Network-based formulations of the quadratic assignment problem ⋮ A directional decomposition heuristic for one-dimensional, non-equidistant machine-cell location problems ⋮ A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method ⋮ Efficient models for the facility layout problem
Cites Work
This page was built for publication: A branch-and-bound-based heuristic for solving the quadratic assignment problem
