Master of Science
Gary E. Whitehouse
The branch-and-bound method for solving the single stage sequencing problem is investigated from the standpoint of the efficiency of the algorithmic search process as a function of the rule used for deciding on the node to branch from next.
McCormick, George P., "An investigation of an alternate strategy for choosing intermediate nodes in a brandh-and-bound algorithm" (1968). Theses and Dissertations. 3692.