High-performance solver for binary quadratic problems

Hrga, Timotej (avtor), Povh, Janez (avtor), Wiegele, Angelika (avtor)

Many problems in combinatorial optimization can be formulated as constrained binary quadratic problems(BQPs),which are in genera lNP hard. We present a method for finding exact solutions of large-scale linearly constrained binary quadratic programming problems. Our exact solution method combines parallelization techniques and exact penalty method approach to obtain optimal solutions of problems of sizes that are due to their size unsolvable by existing method sand tools. We use exact penalty method to first efficiently transform constrained BQP into an instance of max-cut. The obtained problem is then solved by parallel branch-and-bound algorithm that uses SDP based relaxations and is implemented using MPI (distributed memory parallel model) on supercomputer HPC located at Faculty of Mechanical Engineering of the University of Ljubljana. We will present numerical results and demonstrate how to submit a graph instance to new opensource parallel solver BiqBin for (BQPs) which is available as an online service.

• Jezik: Angleški jezik
• Ključne besede: high-performance computing, combinatorial optimization, max-cut problem
• Tipologija: 1.12 - Objavljeni povzetek znanstvenega prispevka na konferenci
• Organizacija: FS - Fakulteta za strojništvo
• Leto izida: 2018
• Št. strani: Str. 309
• PID: 20.500.12556/RUL-101999
• UDK: 519.8(045)
• COBISS.SI-ID: 16150811
• Datum objave v RUL: 19.07.2018

Gradivo je del monografije

• Naslov: ISMP 2018
• Kraj izida: Bordeaux
• Založnik: University of Bordeaux
• Leto izida: 2018
• COBISS.SI-ID: 16150299

Sekundarni jezik

• Jezik: Slovenski jezik
• Ključne besede: visoko zmogljivo računalništvo, kombinatorična optimizacija, problem maksimalnega prereza