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

Optimum Seeking with Branch and Bound

Author

Listed:
  • Norman Agin

    (Mathematica)

Abstract

A wide variety of branch and bound algorithms have recently been described in the literature. This paper provides a generalized description of such algorithms. An objective is to demonstrate the wide applicability of branch and bound to combinatorial problems in general. Two existing algorithms are used as illustrations and a discussion of computational efficiency is included.

Suggested Citation

  • Norman Agin, 1966. "Optimum Seeking with Branch and Bound," Management Science, INFORMS, vol. 13(4), pages 176-185, December.
    • Handle: RePEc:inm:ormnsc:v:13:y:1966:i:4:p:b176-b185
    DOI: 10.1287/mnsc.13.4.B176
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.13.4.B176
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.13.4.B176?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
    ---><---

    Citations

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


    Cited by:

    1. Etgar, Ran & Gelbard, Roy & Cohen, Yuval, 2017. "Optimizing version release dates of research and development long-term processes," European Journal of Operational Research, Elsevier, vol. 259(2), pages 642-653.
    2. Jouglet, Antoine & Carlier, Jacques, 2011. "Dominance rules in combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 212(3), pages 433-444, August.
    3. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "A Recursive Approach To The Implementation Of Enumerative Methods," Econometric Institute Archives 272202, Erasmus University Rotterdam.
    4. Alexander A. Lazarev & Nikolay Pravdivets & Frank Werner, 2020. "On the Dual and Inverse Problems of Scheduling Jobs to Minimize the Maximum Penalty," Mathematics, MDPI, vol. 8(7), pages 1-15, July.

    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:13:y:1966:i:4:p:b176-b185. 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.