Abstract
We present an improved branch and bound algorithm for pure 0-1 programs. This LP based approach employs a new reduction scheme for variables not fixed so far. To implement this reduction the necessary informations are derived from the optimal simplex tableau belonging to the current node of the branch and bound tree, With the stated test we are able to fathom in advance such nodes which have to be enumerated in the former version of the algorithm.
Full Text
Published Version
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