A quadratic assignment problem without column constraints
From MaRDI portal
Publication:5580104
DOI10.1002/nav.3800160312zbMath0186.24909OpenAlexW1558105038MaRDI QIDQ5580104
Publication date: 1969
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800160312
Related Items
The bipartite quadratic assignment problem and extensions ⋮ A Lagrangian relaxation algorithm for sparse quadratic assignment problems ⋮ The Boolean quadratic programming problem with generalized upper bound constraints ⋮ Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme ⋮ An exact algorithm for the minimum squared load assignment problem ⋮ Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
Cites Work