Implementation of Parallel Branch-and-bound Algorithms in XPRESS-MP

Richard S. Laundy

Chapter 2 in Operational Research in Industry, 1999, pp 25-41 from Palgrave Macmillan

Abstract: Abstract With the recent advances in parallel computers and computer networks there has been considerable interest in developing parallel algorithms for solving combinatorial optimization problems. A natural area for research has been ways to parallelize the standard branch-and-bound (B&B) tree search algorithm for solving mixed-integer programming problems. Two approaches to parallelizing the branch-and-bound treesearch algorithm have been taken. These can be categorized as centralized storage methods and distributed storage methods (Bixby et ai, 1988). The centralized storage methods have a centralized storage of work packages and use a single process to distribute the work packages, while in the distributed storage methods each process has its own pool of work packages.

Keywords: Local Search; Tree Search; Parent Node; Integer Solution; Parallel Code (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:palchp:978-0-230-37292-4_2

Ordering information: This item can be ordered from
http://www.palgrave.com/9780230372924

DOI: 10.1057/9780230372924_2

Access Statistics for this chapter

More chapters in Palgrave Macmillan Books from Palgrave Macmillan
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().