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...

Full description

Bibliographic Details

Published in:	Procedia computer science Vol. 108; pp. 1532 - 1541
Main Authors:	Voloshinov, Vladimir, Smirnov, Sergey, Sukhoroslov, Oleg
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 2017
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!