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

DOI10.1023/A:1018308718386zbMATH Open0897.90159OpenAlexW1502090612MaRDI QIDQ1384091FDOQ1384091

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

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

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)

Cited In (3)

• Title not available (Why is that?)
• Selected topics on assignment problems
• A survey for the quadratic assignment problem

Uses Software

• QAPLIB
• ZRAM

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)