IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v23y1977i8p904-908.html
   My bibliography  Save this article

Note--On the Use of Fictitious Bounds in Tree Search Algorithms

Author

Listed:
  • Mokhtar S. Bazaraa

    (Georgia Institute of Technology)

  • Alwalid N. Elshafei

    (Institute of Planning, Cairo, Egypt)

Abstract

One of the strategies used by many tree search algorithms is to follow down one path in the tree until either a feasible solution is found or else fathoming occurs. For a minimization problem, the lower bounds calculated at various tree nodes tend to be well below the optimal value of the objective function, let alone the values of the successively improving upper bounds. As a result fathoming usually occurs only deep in the tree, and consequently, the search becomes rather lengthy. The purpose of this note is to describe a procedure for using and updating fictitious upper bounds in a systematic way so that optimal and suboptimal solutions can be obtained with a smaller computational effort. The procedure is illustrated by two examples: the traveling salesman problem and the quadratic assignment problem.

Suggested Citation

  • Mokhtar S. Bazaraa & Alwalid N. Elshafei, 1977. "Note--On the Use of Fictitious Bounds in Tree Search Algorithms," Management Science, INFORMS, vol. 23(8), pages 904-908, April.
    • Handle: RePEc:inm:ormnsc:v:23:y:1977:i:8:p:904-908
    DOI: 10.1287/mnsc.23.8.904
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.23.8.904
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.23.8.904?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:inm:ormnsc:v:23:y:1977:i:8:p:904-908. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.