IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v4y1976i5p571-576.html
   My bibliography  Save this article

Dynamic strategies for branch and bound

Author

Listed:
  • Glover, Fred
  • Tangedahl, Lee

Abstract

Some straightforward but unconventional strategies are proposed for implementing branch and bound methods. These include 'shrinking' the branch and bound tree and instituting 'branch reversals' by reference to the notion of the relative influence of particular branches in the current solution. An attractive feature of these strategies is their ease of implementation, and the fact that they free the solution process from its customary dependency on early branches created on the basis of inadequate information.

Suggested Citation

  • Glover, Fred & Tangedahl, Lee, 1976. "Dynamic strategies for branch and bound," Omega, Elsevier, vol. 4(5), pages 571-576.
  • Handle: RePEc:eee:jomega:v:4:y:1976:i:5:p:571-576
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(76)90007-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Saïd Hanafi & Fred Glover, 2002. "Resolution Search and Dynamic Branch-and-Bound," Journal of Combinatorial Optimization, Springer, vol. 6(4), pages 401-423, December.
    2. Gianni Codato & Matteo Fischetti, 2006. "Combinatorial Benders' Cuts for Mixed-Integer Linear Programming," Operations Research, INFORMS, vol. 54(4), pages 756-766, August.

    More about this item

    Statistics

    Access and download statistics

    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:eee:jomega:v:4:y:1976:i:5:p:571-576. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.