IDEAS home Printed from https://ideas.repec.org/h/pal/palchp/978-0-230-37292-4_2.html
   My bibliography  Save this book chapter

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

In: Operational Research in Industry

Author

Listed:
  • Richard S. Laundy

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.

Suggested Citation

  • Richard S. Laundy, 1999. "Implementation of Parallel Branch-and-bound Algorithms in XPRESS-MP," Palgrave Macmillan Books, in: Tito A. Ciriani & Stefano Gliozzi & Ellis L. Johnson & Roberto Tadei (ed.), Operational Research in Industry, chapter 2, pages 25-41, Palgrave Macmillan.
    • Handle: RePEc:pal:palchp:978-0-230-37292-4_2
    DOI: 10.1057/9780230372924_2
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Richard Laundy & Michael Perregaard & Gabriel Tavares & Horia Tipi & Alkis Vazacopoulos, 2009. "Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 304-313, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:palchp:978-0-230-37292-4_2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.