branch-and-bound framework; sequencing problems; dynamic programming; depth-first search; dominance rules; algorithms;  quadratic traveling salesman problem; traveling repairman problem