Solving large-scale QAP problems in parallel with the serach library ZRAM

DOI10.1006/JPDC.1998.1434MaRDI QIDQ1268834zbMATH OpenOpenAlexFDO

Authors Adrian Brüngger, Ambros Marzetta, Jens Clausen, Michael Perregaard

Publication date 1 November 1998

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1998.1434

zbMATH Keywords

QAP problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Solving large quadratic assignment problems in parallel
• The parallel search bench ZRAM and its applications
• A parallel depth first search branch and bound algorithm for the quadratic assignment problem

Cited in

(6)

• The parallel search bench ZRAM and its applications
• A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
• An Event-Driven Algorithm for Agents on the Web
• Pushing the limits of solvable QAP problems using parallel processing -- is Nugent30 within reach?
• Gilmore-Lawler bound of quadratic assignment problem
• A survey for the quadratic assignment problem

Describes a project that uses

Uses Software

• ZRAM

This page was built for publication: Solving large-scale QAP problems in parallel with the serach library ZRAM

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