izpis_h1_title_alt

High-performance solver for binary quadratic problems
Hrga, Timotej (Avtor), Povh, Janez (Avtor), Wiegele, Angelika (Avtor)

Gradivo nima datotek.
Gradivo je morda fizično dosegljivo v knjižnici fakultete, zalogo lahko preverite v COBISS-u. Povezava se odpre v novem oknu

Izvleček
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
UDK:519.8(045)
COBISS.SI-ID:16150811 Povezava se odpre v novem oknu
Število ogledov:508
Število prenosov:0
Metapodatki:XML RDF-CHPDL DC-XML DC-RDF
 
Skupna ocena:(0 glasov)
Vaša ocena:Ocenjevanje je dovoljeno samo prijavljenim uporabnikom.
:
Objavi na:AddThis
AddThis uporablja piškotke, za katere potrebujemo vaše privoljenje.
Uredi privoljenje...

Gradivo je del monografije

Naslov:ISMP 2018
Založnik:University of Bordeaux
COBISS.SI-ID:16150299 Povezava se odpre v novem oknu
Kraj izida:Bordeaux
Leto izida:2018

Sekundarni jezik

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

Podobna dela

Podobna dela v RUL:
Podobna dela v drugih slovenskih zbirkah:

Komentarji

Dodaj komentar

Za komentiranje se morate prijaviti.

Komentarji (0)
0 - 0 / 0
 
Ni komentarjev!

Nazaj