Open AccessTEMPLATE REALIZATION OF GENERALIZED BRANCH AND BOUND ALGORITHM
Author(s) -
Milda Baravykaitė,
Raimondas Čiegis,
Julius Žilinskas
Publication year - 2005
Publication title -
mathematical modelling and analysis/mathematical modeling and analysis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.491
H-Index - 25
eISSN - 1648-3510
pISSN - 1392-6292
DOI - 10.3846/13926292.2005.9637283
Subject(s) - branch and bound , algorithm , global optimization , realization (probability) , computer science , combinatorial optimization , mathematics , statistics
In this work we consider a template for implementation of parallel branch and bound algorithms. The main aim of this package to ease implementation of covering and combinatorial optimization methods for global optimization. Standard parts of global optimization algorithms are implemented in the package and only method specific rules should be implemented by the user. The parallelization part of the tool is described in details. Results of computational experiments are presented and discussed.Straipsnyje pristatyta apibendrinto šaku ir režiu algoritmo šablono realizacija. Irankis skirtas palengvinti nuosekliuju ir lygiagrečiuju optimizacijos uždaviniu programu kūrima. Nuo uždavinio nepriklausančios algoritmo dalys yra idiegtos šablone ir vartotojui reikia sukurti tik nuo uždavinio priklausančiu daliu realizacija. Šablone idiegti keli lygiagretieji algoritmai, paremti tyrimo srities padalinimu tarp procesoriu. Pateikiami skaičiavimo eksperimentu rezultatai.