A new lower bound for the quadratic assignment problem

DOI10.1016/0041-5553(87)90203-5zbMath0665.90061OpenAlexW2009168094MaRDI QIDQ3818125

S. I. Sergeev

Publication date: 1987

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(87)90203-5

zbMATH Keywords

quadratic assignmentfacility locationlower and upper boundsnon-linear discrete programmingpairwise assignment group

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)

This page was built for publication: A new lower bound for the quadratic assignment problem