Dynamic strategies for branch and bound
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.
Volume (Year): 4 (1976)
Issue (Month): 5 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.