Abstract

A combination of the branching procedures suggested for integer programming by Land and Doig (1960) and Dakin (1965) is presented. It consists of a controlled number of "head branches" setting a variable equal to integers, and two "shoulder branches" which restrict the value of this variable by a lower bound and by an upper bound, respectively. This branching procedure combines the advantages of both parents techniques.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.