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

DOI10.1023/A:1018308718386MaRDI QIDQ1384091zbMATH OpenOpenAlexFDO

Authors Jens Clausen, Stefan E. Karisch, Michael Perregaard

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 optimizationlower boundsquadratic assignmentparallel branch-and-bound

Mathematics Subject Classification ID

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

Recommendations

• Solving large quadratic assignment problems in parallel
• Lower bounds for the quadratic assignment problem via triangle decompositions
• scientific article; zbMATH DE number 714527
• scientific article; zbMATH DE number 714538

Cited in

(3)

• scientific article; zbMATH DE number 714538 (Why is no real title available?)
• Selected topics on assignment problems
• A survey for the quadratic assignment problem

Describes a project that uses

Uses Software

• ZRAM
• QAPLIB

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384091)