Effectiveness of the application of the branch-and-bound technique to solve travelling salesman and flow-shop-scheduling problems
