Solving Previously Unsolved MIP Instances with ParaSCIP on Supercomputers by using up to 80,000 Cores

Please always quote using this URN: urn:nbn:de:0297-zib-78393
  • Mixed-integer programming (MIP) problem is arguably among the hardest classes of optimization problems. This paper describes how we solved 21 previously unsolved MIP instances from the MIPLIB benchmark sets. To achieve these results we used an enhanced version of ParaSCIP, setting a new record for the largest scale MIP computation: up to 80,000 cores in parallel on the Titan supercomputer. In this paper, we describe the basic parallelization mechanism of ParaSCIP, improvements of the dynamic load balancing and novel techniques to exploit the power of parallelization for MIP solving. We give a detailed overview of computing times and statistics for solving open MIPLIB instances.

Download full text files

Export metadata

Metadaten
Author:Yuji ShinanoORCiD, Tobias AchterbergORCiD, Timo BertholdORCiD, Stefan Heinz, Thorsten KochORCiD, Michael Winkler
Document Type:ZIB-Report
Tag:Mixed Integer Programming, Parallel processing, Node merging, Racing, ParaSCIP, Ubiquity Generator Framework, MIPLIB
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:D. Software
Date of first Publication:2020/05/28
Series (Serial Number):ZIB-Report (20-16)
ISSN:1438-0064