Resolution Search and Dynamic Branch-and-Bound

Saïd Hanafi () and Fred Glover ()
Additional contact information
Saïd Hanafi: Université de Valenciennes et du Hainaut-Cambrésis, Le Mont Houy
Fred Glover: University of Mississippi

Journal of Combinatorial Optimization, 2002, vol. 6, issue 4, No 3, 423 pages

Abstract: 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.

Keywords: branch-and-bound; dynamic branch-and-bound; resolution search; mixed integer programming (search for similar items in EconPapers)
Date: 2002
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/A:1019573820792 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:6:y:2002:i:4:d:10.1023_a:1019573820792

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1019573820792

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().