The following is the complete branch and bound tree for an ILP over decision variables x1,c, x4
Question:
The following is the complete branch and bound tree for an ILP over decision variables x1,c, x4 = 0 or 1.
(a) List the partial solutions associated with each node of the tree.
(b) Which nodes were branched and which terminated?
(c) Identify the nodes of the tree that have x = 10, 1, 0, 12 as a feasible completion.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Question Posted: