Theses and Dissertations
Now showing items 1-1 of 1
A branch-and-bound algorithm for the solution of sequence dependent routing problems
(Monterey, California; Naval Postgraduate School, 1970-04)
A branch-and-bound algorithm, which finds the optimal route through n nodes when a different cost matrix occurs after each arc in the sequence is traversed, is presented. The route may begin at any node and must pass ...