N < 3 BRANCH AND BOUND METHODS FOR THE TRAVELING SALESMAN PROBLEM by