Solving hard MIPLIB2003 problems with ParaSCIP on Supercomputers: An update

Please always quote using this URN: urn:nbn:de:0297-zib-42888
  • Contemporary supercomputers can easily provide years of CPU time per wall-clock hour. One challenge of today's software development is how to harness this wast computing power in order to solve really hard mixed integer programming instances. In 2010, two out of six open MIPLIB2003 instances could be solved by ParaSCIP in more than ten consecutive runs, restarting from checkpointing files. The contribution of this paper is threefold: For the first time, we present computational results of single runs for those two instances. Secondly, we provide new improved upper and lower bounds for all of the remaining four open MIPLIB2003 instances. Finally, we explain which new developments led to these results and discuss the current progress of ParaSCIP. Experiments were conducted on HLRNII, on HLRN III, and on the Titan supercomputer, using up to 35,200 cores.

Export metadata

  • Export Bibtex
Author:Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch, Michael Winkler
Document Type:ZIB-Report
Tag:MIPLIB2003; Mixed Integer Programming; ParaSCIP; Supercomputer; Ubiquity Generator Framework
MSC-Classification:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C11 Mixed integer programming
CCS-Classification:G. Mathematics of Computing
Date of first Publication:2013/10/21
Series (Serial Number):ZIB-Report (13-66)
Licence (German):License LogoCreative Commons - Namensnennung-Keine Bearbeitung

$Rev: 13581 $