Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Solving Challenging Large Scale QAPs

Please always quote using this URN: urn:nbn:de:0297-zib-81303
  • We report our progress on the project for solving larger scale quadratic assignment problems (QAPs). Our main approach to solve large scale NP-hard combinatorial optimization problems such as QAPs is a parallel branch-and-bound method efficiently implemented on a powerful computer system using the Ubiquity Generator(UG) framework that can utilize more than 100,000 cores. Lower bounding procedures incorporated in the branch-and-bound method play a crucial role in solving the problems. For a strong lower bounding procedure, we employ the Lagrangian doubly nonnegative (DNN) relaxation and the Newton-bracketing method developed by the authors’ group. In this report, we describe some basic tools used in the project including the lower bounding procedure and branching rules, and present some preliminary numerical results. Our next target problem is QAPs with dimension at least 50, as we have succeeded to solve tai30a and sko42 from QAPLIB for the first time.

Download full text files

Export metadata

Author:Koichi Fujii, Naoki Ito, Sunyoung Kim, Masakazu Kojima, Yuji ShinanoORCiD, Kim-Chuan Toh
Document Type:ZIB-Report
Tag:Parallel Branch-and-Bound; QAP
MSC-Classification:68-XX COMPUTER SCIENCE (For papers involving machine computations and programs in a specific mathematical area, see Section -04 in that area)
CCS-Classification:I. Computing Methodologies
Date of first Publication:2021/01/23
Series (Serial Number):ZIB-Report (21-02)
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.