On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel

DOI10.1023/A:1018308718386zbMath0897.90159OpenAlexW1502090612MaRDI QIDQ1384091

Michael Perregaard, Stefan E. Karisch, Jens Clausen

Publication date: 1 July 1998

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018308718386

zbMATH Keywords

combinatorial optimizationquadratic assignmentlower boundsparallel branch-and-bound

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27) Parallel numerical computation (65Y05)

Related Items (2)

A survey for the quadratic assignment problem ⋮ Selected topics on assignment problems

Uses Software

• QAPLIB
• ZRAM

This page was built for publication: On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel