Implementation and Use of Coarse-grained Parallel Branch-and-bound in Everest Distributed Environment

This paper examines the coarse-grained approach to parallelization of the branch-and-bound (B&B) algorithm in a distributed computing environment. This approach is based on preliminary decomposition of a feasible domain of mixed-integer programming problem into a set of subproblems. The produced...

Celý popis

Podrobná bibliografie

Vydáno v:	Procedia computer science Ročník 108; s. 1532 - 1541
Hlavní autoři:	Voloshinov, Vladimir, Smirnov, Sergey, Sukhoroslov, Oleg
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 2017
Témata:	algebraic modeling languages branch-and-bound coarse grained parallelism distributed computing domain decomposition mixed-integer programming Traveling Salesman Problem branch-and-bound domain decomposition algebraic modeling languages mixed-integer programming coarse grained parallelism Traveling Salesman Problem distributed computing
ISSN:	1877-0509, 1877-0509
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!