Asymptotic Properties of the Quadratic Assignment Problem

DOI10.1287/moor.10.1.100zbMath0576.90061OpenAlexW2128073594MaRDI QIDQ3696855

M. van Houweninge, J. B. G. Frenk, Alexander H. G. Rinnooy Kan

Publication date: 1985

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.10.1.100

zbMATH Keywords

rates of convergencequadratic assignmentexperimental resultsmatrix minimization

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (12)

A survey for the quadratic assignment problem ⋮ A note on asymptotic properties of the quadratic assignment problem ⋮ Combinational optimization problems for which almost every algorithm is asymptotically optimal ⋮ Bounds for Random Binary Quadratic Programs ⋮ Average performance of greedy heuristics for the integer knapsack problem. ⋮ The random quadratic assignment problem ⋮ Random assignment problems ⋮ Selected topics on assignment problems ⋮ A note on the asymptotic behaviour of bottleneck problems ⋮ Posterior agreement for large parameter-rich optimization problems ⋮ An asymptotical study of combinatorial optimization problems by means of statistical mechanics ⋮ Probabilistic asymptotic properties of some combinatorial optimization problems

This page was built for publication: Asymptotic Properties of the Quadratic Assignment Problem