IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v6y2002i4d10.1023_a1019573820792.html
   My bibliography  Save this article

Resolution Search and Dynamic Branch-and-Bound

Author

Listed:
  • Saïd Hanafi

    (Université de Valenciennes et du Hainaut-Cambrésis, Le Mont Houy)

  • Fred Glover

    (University of Mississippi)

Abstract

A novel approach to pure 0-1 integer programming problems called Resolution Search has been proposed by Chvatal (Discrete Applied Mathematics, vol. 73, pp. 81–99, 1997) as an alternative to implicit enumeration, with a demonstration that the method can yield more effective branching strategies. We show that an earlier method called Dynamic Branch-and-Bound (B&B) yields the same branching strategies as Resolution Search, and other strategic alternatives in addition. Moreover, Dynamic B&B is not restricted to pure 0-1 problems, but applies to general mixed integer programs containing both general integer and continuous variables. We provide examples comparing Resolution Search to enhanced variants. We also show the relation of these approaches to Dynamic B&B, suggesting the value of further study of this neglected approach.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:6:y:2002:i:4:d:10.1023_a:1019573820792
    DOI: 10.1023/A:1019573820792
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1019573820792
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1019573820792?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
    ---><---

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

    References listed on IDEAS

    as
    1. Glover, Fred & Tangedahl, Lee, 1976. "Dynamic strategies for branch and bound," Omega, Elsevier, vol. 4(5), pages 571-576.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gianni Codato & Matteo Fischetti, 2006. "Combinatorial Benders' Cuts for Mixed-Integer Linear Programming," Operations Research, INFORMS, vol. 54(4), pages 756-766, August.

    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:spr:jcomop:v:6:y:2002:i:4:d:10.1023_a:1019573820792. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.springer.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.